A recursive quadratic programming algorithm for semi-infinite optimization problems

DOI10.1007/BF01447767zbMath0494.90058OpenAlexW1975662748MaRDI QIDQ1169401

Elijah Polak, André L. Tits

Publication date: 1982

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01447767

zbMATH Keywords

quadratic convergencesemi-infinite optimizationglobally convergent algorithmlocal recursive quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

An efficient algorithm for solving semi-infinite inequality problems with box constraints, Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming, An interior semi-infinite programming method, A comparative study of several semi-infinite nonlinear programming algorithms, ImplementableL_∞penalty-function method for semi-infinite optimization, Nonlinear robust optimization via sequential convex bilevel programming, Global convergence of a semi-infinite optimization method, Unnamed Item, Robot trajectory planning with semi-infinite programming., A barrier function method for minimax problems, A new smoothing Newton-type algorithm for semi-infinite programming, A smoothing Newton method for semi-infinite programming, An iterative method for solving KKT system of the semi-infinite programming, A globally convergent SQP method for semi-infinite nonlinear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• A robust secant method for optimization problems with inequality constraints
• On the global stabilization of locally convergent algorithms
• A globally convergent method for nonlinear programming
• Algorithms for a class of computer-aided design problems: A review
• An improved algorithm for optimization problems with functional inequality constraints
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• An algorithm for optimization problems with functional inequality constraints
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems