Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Quadratic Equations01:29

Quadratic Equations

368
A quadratic equation is an algebraic expression where a variable is raised to the second power and combined with its first power and a constant; all equated to zero. These equations are frequently used to model relationships involving area, motion, and optimization. The general representation of a quadratic equation iswhere a, b, and c are real values, and a is nonzero to ensure the presence of the squared term.One method for solving a quadratic equation involves rewriting it as a product of...
368
Quadratic Models01:23

Quadratic Models

241
Quadratic models are mathematical representations used to describe relationships in which the rate of change changes at a constant rate. These models appear in a wide variety of natural and engineered systems, especially those involving motion, forces, and optimization. One common application is analyzing the vertical motion of objects influenced by gravity, such as a ball thrown into the air.In such scenarios, the object's height changes over time in a curved pattern, rising to a maximum point...
241
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

319
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
319
Quadratic Equations in the Complex Number System01:29

Quadratic Equations in the Complex Number System

532
A quadratic equation in the form ax2+bx+c=0 can have solutions that vary in nature depending on the value of the discriminant, b2−4ac. In this expression, a is the coefficient of the quadratic term x2, b is the coefficient of the linear term x, and c is the constant term. When the discriminant is negative, the equation has no real number solutions. However, by introducing complex numbers through the imaginary unit i, defined by i=-1, these equations can still be solved.The square root of...
532
Global Climate Change01:50

Global Climate Change

29.0K
Throughout its ~4.5 billion year history, the Earth has experienced periods of warming and cooling. However, the current drastic increase in global temperatures is well outside of the Earth’s cyclic norms, and evidence for human-caused global climate change is compelling. Paleoclimatology, the study of ancient climate conditions, provides ample evidence for human-caused global climate change by comparing recent conditions with those in the past.
29.0K
Accelerators01:17

Accelerators

291
Accelerators in concrete serve as admixtures to speed up the hardening process, enabling the concrete to achieve early strength faster. Although accelerators do not necessarily impact the time it takes concrete to set, they reduce this time in practice. A common accelerator is calcium chloride, which is particularly useful for hastening early strength development in cold weather or for rapid repair jobs that require quick heat generation after mixing.
The effectiveness of calcium chloride can...
291

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Are juvenile offenders psychologically different from juvenile criminals? A preliminary investigation.

Frontiers in psychology·2026
Same author

Computational biomechanics for a standing human body: Modal analysis and simulation.

International journal for numerical methods in biomedical engineering·2024
Same author

Peer assumption: an illusory consensus hidden in the criminal responsibility of juvenile offender-evidence from psychology.

Frontiers in psychology·2024
Same author

Theoretical basis and occurrence of internet fraud victimisation: Based on two systems in decision-making and reasoning.

Frontiers in psychology·2023
Same author

The role of transposon inverted repeats in balancing drought tolerance and yield-related traits in maize.

Nature biotechnology·2022
Same author

A New Strategy in Boosting Information Spread.

Entropy (Basel, Switzerland)·2022
Same journal

The infimum values of two probability functions for the Gamma distribution.

Journal of inequalities and applications·2024
Same journal

The existence of nonnegative solutions for a nonlinear fractional <i>q</i>-differential problem via a different numerical approach.

Journal of inequalities and applications·2021
Same journal

Correction to: On the spectral norms of <i>r</i>-circulant matrices with the bi-periodic Fibonacci and Lucas numbers.

Journal of inequalities and applications·2019
Same journal

Erratum to: General Bahr-Esseen inequalities and their applications.

Journal of inequalities and applications·2019
Same journal

Hermite-Hadamard type inequalities for <i>F</i>-convex function involving fractional integrals.

Journal of inequalities and applications·2019
Same journal

Global maximal inequality to a class of oscillatory integrals.

Journal of inequalities and applications·2019
See all related articles

Related Experiment Video

Updated: Feb 6, 2026

Programmed Electrical Stimulation in Mice
07:29

Programmed Electrical Stimulation in Mice

Published on: May 26, 2010

21.3K

An accelerating algorithm for globally solving nonconvex quadratic programming.

Li Ge1,2, Sanyang Liu1

  • 11School of Mathematics and Statistics, Xidian University, Xi'an, China.

Journal of Inequalities and Applications
|August 24, 2018
PubMed
Summary
This summary is machine-generated.

This study introduces an accelerating linearizing algorithm to solve nonconvex quadratic programming problems. The novel approach enhances convergence speed and demonstrates high feasibility and efficiency in experimental results.

Keywords:
Branch and boundDeleting techniqueGlobal optimizationLinear relaxation approachNonconvex quadratic programming

More Related Videos

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

3.0K
Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.5K

Related Experiment Videos

Last Updated: Feb 6, 2026

Programmed Electrical Stimulation in Mice
07:29

Programmed Electrical Stimulation in Mice

Published on: May 26, 2010

21.3K
Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

3.0K
Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.5K

Area of Science:

  • Optimization
  • Mathematical Programming
  • Computer Science

Background:

  • Nonconvex quadratic programming problems present significant computational challenges.
  • Existing methods may suffer from slow convergence or limited applicability.

Purpose of the Study:

  • To develop an efficient and feasible algorithm for global solutions to nonconvex quadratic programming problems.
  • To improve the convergence speed of existing branch-and-bound methods.

Main Methods:

  • An accelerating linearizing algorithm is proposed, based on the branch-and-bound framework.
  • A novel linear relaxation approach is employed to derive lower bounds.
  • Region-deletion techniques are utilized to accelerate convergence.

Main Results:

  • The algorithm is proven to be convergent.
  • Experimental results indicate high feasibility and efficiency.
  • The method effectively obtains lower bounds for the optimal value.

Conclusions:

  • The proposed accelerating linearizing algorithm offers an effective solution for nonconvex quadratic programming.
  • The novel linear relaxation and region-deletion strategies enhance computational performance.