A quadratically convergent algorithm for solving infinite dimensional inequalities

DOI10.1007/BF01460116MaRDI QIDQ1056201zbMATH OpenFDO

Authors D. Q. Mayne, Elijah Polak

Publication date 1982

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

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

zbMATH Keywords

infinite dimensional inequalitiesquadratic rate of convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• An algorithm for optimization problems with functional inequality constraints
• An improved algorithm for optimization problems with functional inequality constraints
• Combined phase I—phase II methods of feasible directions
• scientific article; zbMATH DE number 3728119 (Why is no real title available?)
• On the global stabilization of locally convergent algorithms

Cited in

(6)

• A barrier function method for minimax problems
• An efficient algorithm for solving semi-infinite inequality problems with box constraints
• Outer approximation algorithm for nondifferentiable optimization problems
• Nonlinear robust optimization via sequential convex bilevel programming
• An augmented Lagrangian based algorithm for distributed nonconvex optimization
• A parallel algorithm for semi-infinite programming

This page was built for publication: A quadratically convergent algorithm for solving infinite dimensional inequalities

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