Skip to search formSkip to main contentSkip to account menu

Quadratic programming

Known as: QP, Quadratic program 
Quadratic programming (QP) is a special type of mathematical optimization problem—specifically, the problem of optimizing (minimizing or maximizing… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Load balancing is widely used in computing systems as a way to optimize performance by equalizing loads to reduce delays, such as… 
2004
2004
We prove a sufficient global optimality condition for the problem of minimizing a quadratic function subject to quadratic… 
Highly Cited
2004
Highly Cited
2004
This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems… 
Highly Cited
2000
Highly Cited
2000
This paper presents a systematic and computable method for choosing the regularization parameter appearing in Tikhonov-type… 
Highly Cited
1999
Highly Cited
1999
The strategy for obtaining global convergence is based on the trust region approach. The merit function is a type of augmented… 
Highly Cited
1987
Highly Cited
1987
In this paper we investigate for given one-parameter families of linear time-invariant finite-dimensional systems the parameter… 
Highly Cited
1975
Highly Cited
1975
Parts: I. Particle Phenomenology: Experiment. II. Particles and Fields: Theory. III. Physics in 2+1 Dimensions. IV. Cosmology…