Live briefing
Everything about Quadratically constrained quadratic program
Optimization problem in mathematics
In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Quadratically constrained quadratic programA 5-minute orientation
- Skim a recent paper: Harmonic Noise Rejection Zeroing Neural Network for Time-Dependent Equality-Constrained Quadratic Program and Its Application to Robot ArmsInfluential work since 2022
- Pick up a classic book: Discovery ScienceThe most-reprinted book on the subject
- Read the landmark paper: Consensus-ADMM for General Quadratically Constrained Quadratic ProgrammingCited 215 times
- Go sideways: Second-order cone programmingA closely related topic
- Go sideways: Semidefinite programmingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Consensus-ADMM for General Quadratically Constrained Quadratic Programming
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Hidden convexity in some nonconvex quadratically constrained quadratic programming
On convex relaxations for quadratically constrained quadratic programming
A relaxation method for nonconvex quadratically constrained quadratic programs
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Dynamic Economic Dispatch Considering Transmission Losses Using Quadratically Constrained Quadratic Program Method
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
🆕 Influential since 2022
Harmonic Noise Rejection Zeroing Neural Network for Time-Dependent Equality-Constrained Quadratic Program and Its Application to Robot Arms
MGRNN for dynamic constrained quadratic programming with verification and applications
Operational optimization of a 4th generation district heating network with mixed integer quadratically constrained programming
Solving Combined Optimal Transmission Switching and Optimal Power Flow sequentially as convexificated Quadratically Constrained Quadratic Program
A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
📚 Books worth reading
Discovery ScienceJean-Gabriel Ganascia · 2012- 📕Nonlinear programmingPeter Zörnig · 2014
The generalized inverse dual for quadratically constrained quadratic programsWilliam David Randolph · 1974
Mathematical programming for agricultural, environmental, and resource economicsHarry Mason Kaiser · 2010
Fundamental Engineering Optimization MethodsFun Kamran Iqbal · 2013
Fundamental Engineering Optimization MethodsKamran Iqbal · 2013- 📕Pseudolinear functions and optimizationShashi Kant Mishra · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Second-order cone programming A second-order cone program (SOCP) is a convex optimization problem of the form minimize fTx subject to ‖Aix+bi‖2≤ciTx+di,i=1,…,m Fx=g where the problem…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Sum-of-squares optimization A sum-of-squares optimization program is an optimization problem with a linear cost function and constraints that certain polynomials constructed from…
- Quadratic programming Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks…
- Convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently…
- Mathematical optimization Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criteria…
- Linear matrix inequality In convex optimization, a linear matrix inequality (LMI) is an expression of the form LMI ( y ) := A 0 + y 1 A 1 + y 2 A 2 + ⋯ + y m A m ⪰ 0 {\displaystyle…
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…