Sequential Quadratic Programming with Penalization of the Displacement

DOI10.1137/0805038MaRDI QIDQ4862783zbMATH OpenOpenAlexFDO

Authors G. Launay, J. Frédéric Bonnans

Publication date 1 February 1996

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0805038

zbMATH Keywords

convergence of a sequential quadratic programming algorithmexact penalizationNewton's methodquasi-Newton algorithmstrust region

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3930730
• Penalty functions, Newton's method, and quadratic programming
• scientific article; zbMATH DE number 3892957
• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• scientific article; zbMATH DE number 3887009

Cited in

(18)

• A feasible and superlinear algorithm for inequality constrained minimization problems
• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• Nonconvex optimization using negative curvature within a modified linesearch
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• scientific article; zbMATH DE number 3887009 (Why is no real title available?)
• Strong uniqueness in sequential linear programming
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
• A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
• scientific article; zbMATH DE number 3892957 (Why is no real title available?)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
• A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
• A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
• A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
• Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
• Sequential penalty quadratic programming filter methods for nonlinear programming

This page was built for publication: Sequential Quadratic Programming with Penalization of the Displacement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862783)