Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,984,633 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AIMMS
ALGLIB
AMPL
APMonitor
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Prioritized multi-criteria decision making based on preference relations
Xiaohan Yu
,
Zeshui Xu
,
Shousheng Liu
Computers & industrial engineering
2013
Corpus ID: 32621755
Highly Cited
2012
Highly Cited
2012
Model predictive controller design and implementation on FPGA with application to motor servo system
Nan Yang
,
Dewei Li
,
Jun Zhang
,
Y. Xi
2012
Corpus ID: 15773568
2009
2009
Linear programming support vector regression with wavelet kernel: A new approach to nonlinear dynamical systems identification
Zhao Lu
,
Jing Sun
,
K. Butts
Mathematics and Computers in Simulation
2009
Corpus ID: 5919149
Highly Cited
2004
Highly Cited
2004
Using MIMO linear control for load balancing in computing systems
Y. Diao
,
J. Hellerstein
,
+4 authors
Christian Garcia-Arellano
Proceedings of the American Control Conference
2004
Corpus ID: 18907081
Load balancing is widely used in computing systems as a way to optimize performance by equalizing loads to reduce delays, such as…
Expand
2004
2004
Sufficient Global Optimality Conditions for Bivalent Quadratic Optimization
M. Pınar
2004
Corpus ID: 15244640
We prove a sufficient global optimality condition for the problem of minimizing a quadratic function subject to quadratic…
Expand
Highly Cited
2004
Highly Cited
2004
Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming
D. Gao
Journal of Global Optimization
2004
Corpus ID: 8967962
This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems…
Expand
Highly Cited
2000
Highly Cited
2000
A method for choosing the regularization parameter in generalized Tikhonov regularized linear inverse problems
S. Oraintara
,
W. C. Karl
,
D. Castañón
,
Truong Q. Nguyen
Proceedings International Conference on Image…
2000
Corpus ID: 7482092
This paper presents a systematic and computable method for choosing the regularization parameter appearing in Tikhonov-type…
Expand
Highly Cited
1999
Highly Cited
1999
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters
F. M. Gomes
,
M. C. Maciel
,
J. Martínez
Mathematical programming
1999
Corpus ID: 3169875
The strategy for obtaining global convergence is based on the trust region approach. The merit function is a type of augmented…
Expand
Highly Cited
1987
Highly Cited
1987
Families of linear-quadratic problems: Continuity properties
H. Trentelman
1987
Corpus ID: 45980275
In this paper we investigate for given one-parameter families of linear time-invariant finite-dimensional systems the parameter…
Expand
Highly Cited
1975
Highly Cited
1975
Methods for Linear and Quadratic Programming
C. Panne
1975
Corpus ID: 202790601
Parts: I. Particle Phenomenology: Experiment. II. Particles and Fields: Theory. III. Physics in 2+1 Dimensions. IV. Cosmology…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE