Sequential Quadratic Programming Methods

DOI10.1007/978-1-4614-1927-3_6zbMath1242.90297OpenAlexW2110018596MaRDI QIDQ2897297

Publication date: 10 July 2012

Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_6

zbMATH Keywords

quadratic programming nonconvex programming SQP methods KKT systems large-scale nonlinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence theories for optimal control problems involving ordinary differential equations (49J15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Existence theories for optimal control problems involving partial differential equations (49J20) Direct numerical methods for linear systems and matrix inversion (65F05) Methods of successive quadratic programming type (90C55)

Related Items (28)

Variations and extension of the convex-concave procedure ⋮ How to measure uncertainty in uncertainty sampling for active learning ⋮ Computing the nearest low-rank correlation matrix by a simplified SQP algorithm ⋮ A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results ⋮ Unnamed Item ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Solving linear optimization over arithmetic constraint formula ⋮ Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ Combining stabilized SQP with the augmented Lagrangian algorithm ⋮ An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems ⋮ Dimensionality reduction for regularization of sparse data-driven RANS simulations ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming ⋮ BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ A stabilized SQP method: superlinear convergence ⋮ A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems ⋮ Newton-type methods: a broader view ⋮ Space-Time Galerkin POD with Application in Optimal Control of Semilinear Partial Differential Equations ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ A stochastic control approach to Slotted-ALOHA random access protocol ⋮ Methods for convex and general quadratic programming

Uses Software

This page was built for publication: Sequential Quadratic Programming Methods