A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
From MaRDI portal
Publication:4852583
DOI10.1137/0805030zbMath0840.65052OpenAlexW2119079709MaRDI QIDQ4852583
Walter Murray, Francisco Javier Prieto
Publication date: 1 November 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/15656
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
A local convergence analysis of bilevel decomposition algorithms, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, Non-iterative co-ordination in multilevel systems, A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives, Primal-dual active-set methods for large-scale optimization, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, Global convergence on an active set SQP for inequality constrained optimization, Goal and predictive coordination in two level hierarchical systems, Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences, An SQP method for general nonlinear programs using only equality constrained subproblems
