Live briefing
Everything about Sequential quadratic programming
Optimization algorithm
Sequential quadratic programming (SQP) is an iterative method for constrained nonlinear optimization, also known as Lagrange-Newton method. SQP methods are used on mathematical problems for which the objective function and the constraints are twice continuously differentiable, but not necessarily convex. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sequential quadratic programmingA 5-minute orientation
- Skim a recent paper: Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programmingInfluential work since 2022
- Pick up a classic book: Numerical optimizationThe most-reprinted book on the subject
- Read the landmark paper: Sequential quadratic programming for large-scale nonlinear optimizationCited 230 times
- Go sideways: Sequential linear-quadratic programmingA closely related topic
- Go sideways: Mehrotra predictor–corrector methodA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Sequential quadratic programming for large-scale nonlinear optimization
A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints
A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization
Sequential quadratic programming for non‐linear elastic contact problems
The sequential linear quadratic programming algorithm for solving dynamic optimization problems - a review.
Sequential penalty quadratic programming filter methods for nonlinear programming
Sequential quadratic programming methods for parametric nonlinear optimization
An efficient sequential quadratic programming algorithm for nonlinear programming
🆕 Influential since 2022
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints
A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
An effective nonlinear interval sequential quadratic programming method for uncertain inverse problems
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
📚 Books worth reading
Numerical optimizationJ. Frédéric Bonnans, Jean Charles Gilbert · 2003- 📕Structural optimization with approximate sensitivitiesSurya N. Patnaik · 1994
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Sequential linear-quadratic programming Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are…
- Mehrotra predictor–corrector method Mehrotra's predictor–corrector method in optimization is a specific interior point method for linear programming. It was proposed in 1989 by Sanjay Mehrotra…
- Noether's second theorem In mathematics and theoretical physics, Noether's second theorem relates symmetries of an action functional with a system of differential equations. The…
- Adjoint state method The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem. It…
- Belinfante–Rosenfeld stress–energy tensor In mathematical physics, the Belinfante–Rosenfeld tensor is a modification of the stress–energy tensor that is constructed from the canonical stress–energy…
- Objective stress rate In continuum mechanics, objective stress rates are time derivatives of stress that do not depend on the frame of reference. Many constitutive equations…
- Regularization by spectral filtering Spectral regularization is any of a class of regularization techniques used in machine learning to control the impact of noise and prevent overfitting…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…