A truncated SQP method based on inexact interior-point solutions of subproblems

DOI10.1137/090758015MaRDI QIDQ3083301zbMATH OpenOpenAlexFDO

Authors A. F. Izmailov, M. V. Solodov

Publication date 21 March 2011

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

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

zbMATH Keywords

superlinear convergenceinexact sequential quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 653036
• scientific article; zbMATH DE number 1096546
• scientific article; zbMATH DE number 3934327
• On the performance of SQP methods for nonlinear optimization
• A matrix-free trust-region SQP method for equality constrained optimization

Cited in

(12)

• A line search filter algorithm with inexact step computations for equality constrained optimization
• Some new facts about sequential quadratic programming methods employing second derivatives
• A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
• scientific article; zbMATH DE number 653036 (Why is no real title available?)
• The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
• Newton-type methods: a broader view
• Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
• Two-phase-SQP method with higher-order convergence property
• A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control
• A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
• An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
• Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds

Describes a project that uses

Uses Software

• SNOPT
• MINOS

This page was built for publication: A truncated SQP method based on inexact interior-point solutions of subproblems

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