Live briefing
Everything about Quadratic programming
Solving an optimization problem with a quadratic objective function
Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Quadratic programmingA 5-minute orientation
- Skim a recent paper: Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite ProgrammingInfluential work since 2022
- Pick up a classic book: Quadratic Programming with Computer ProgramsThe most-reprinted book on the subject
- Read the landmark paper: Control Barrier Function Based Quadratic Programs for Safety Critical SystemsCited 2,694 times
- Go sideways: Linear complementarity problemA closely related topic
- Go sideways: Quadratic knapsack problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Control Barrier Function Based Quadratic Programs for Safety Critical Systems
An algorithm for quadratic programming
Sequential Quadratic Programming
A quadratic programming procedure
Duality in quadratic programming
A General Quadratic Programming Algorithm
Economic Dispatch Using Quadratic Programming
Approximating quadratic programming with bound and quadratic constraints
🆕 Influential since 2022
Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
Memristor Neural Networks for Linear and Quadratic Programming Problems
Impact-aware task-space quadratic-programming control
Self-Correcting Quadratic Programming-Based Robot Control
A Quadratic Formulation of ESS Degradation and Optimal DC Microgrid Operation Strategy Using Quadratic Programming
📚 Books worth reading
- 📕Quadratic Programming with Computer ProgramsMichael J. Best · 2017
- 📕A software package for sequential quadratic programmingDieter Kraft · 1988
Methods for linear and quadratic programmingC. van de Panne · 1975- 📕Optimized system identificationJer-Nan Juang · 1999
- 📕Comparative evaluation of different optimization algorithms for structural design applicationsSurya N. Patnaik · 1996
- 📕Linear, integer and quadratic programming with LINDOLinus Schrage · 1984
Optimierung linearer Regelsysteme mit quadratischer ZielfunktionH. A. Nour Eldin · 1971- 📕An investigation of new methods for estimating parameter sensitivitiesTodd J. Beltracchi · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known…
- Quadratic knapsack problem The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective…
- Convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently…
- Graver basis In applied mathematics, Graver bases enable iterative solutions of linear and various nonlinear integer programming problems in polynomial time. They were…
- 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…
- Regularized least squares Regularized least squares (RLS) is a family of methods for solving the least-squares problem while using regularization to further constrain the resulting…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Quadratically constrained quadratic program In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and…