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.
2003
2003
(ABSTRACT) High-impedance faults (HIFs) on distribution feeders are abnormal electrical conditions that cannot be detected by… 
2000
2000
This paper presents an iterative optimization technique for improving delay in integrated circuits. The basic idea is to perform… 
1991
1991
Row-action iterative algorithms are developed for two classes of nonlinear optimization problems with transportation constraints… 
1989
1989
Nonlinear quadratic codes that are optimal for the minimax error detection are presented. Characteristic functions for these… 
1983
1983
Algorithme d'optimisation des processus de genie chimique structures, de calcul plus facile et de conception plus claire que… 
1979
1979
We develop several algorithms that obtain the global optimum to the indefinite quadratic programming problem. A generalized… 
Review
1977
Review
1977
Abstract : The fundamental theory and algorithms of quadratic programming and linear complementarity are presented in expository… 
Highly Cited
1975
Highly Cited
1975
Parts: I. Particle Phenomenology: Experiment. II. Particles and Fields: Theory. III. Physics in 2+1 Dimensions. IV. Cosmology… 
1966
1966
The paper gives a comparison of Beale's method for quadratic programming and the Simplex Method for quadratic programming as…