Sequential Quadratic Programming with Penalization of the Displacement
From MaRDI portal
Publication:4862783
DOI10.1137/0805038zbMath0841.90110OpenAlexW1989921393MaRDI QIDQ4862783
G. Launay, Joseph 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
Newton's methodexact penalizationtrust regionquasi-Newton algorithmsconvergence of a sequential quadratic programming algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (11)
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices ⋮ 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 Mixed and Superlinearly Convergent Algorithm for Constrained Optimization ⋮ Nonconvex optimization using negative curvature within a modified linesearch ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity ⋮ 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 feasible and superlinear algorithm for inequality constrained minimization problems ⋮ A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
This page was built for publication: Sequential Quadratic Programming with Penalization of the Displacement
