Local Convergence of SQP Methods in Semi-Infinite Programming

DOI10.1137/0805031MaRDI QIDQ4852584zbMATH OpenOpenAlexFDO

Authors

Publication date 27 June 1996

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

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

zbMATH Keywords

Broyden-Fletcher-Goldfarb-Shanno updateconvergencesemi-infinite programmingsequential quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34)

Recommendations

• Recursive quadratic methods with the use of consistent approximations for semi-infinite programming problems
• Global convergence of a robust smoothing SQP method for semi-infinite programming
• scientific article; zbMATH DE number 48566
• Global convergence of inexact reduced sqp methods
• An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space

Cited in

(16)

• A smoothing Newton method for semi-infinite programming
• On the numerical treatment of linearly constrained semi-infinite optimization problems
• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
• A new adaptive method to nonlinear semi-infinite programming
• Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
• An efficient algorithm for - convex semi-infinite programming problems
• On linear-quadratic elliptic control problems of semi-infinite type
• Interior point filter method for semi-infinite programming problems
• An iterative method for solving KKT system of the semi-infinite programming
• A reduction method for semi-infinite programming by means of a global stochastic approach†
• Recursive quadratic methods with the use of consistent approximations for semi-infinite programming problems
• Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
• On the convergence of local solutions for the method quADAPT
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
• An inexact primal-dual algorithm for semi-infinite programming

This page was built for publication: Local Convergence of SQP Methods in Semi-Infinite Programming

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