A quadratically convergent algorithm for solving infinite dimensional inequalities

DOI10.1007/BF01460116zbMath0522.65045MaRDI QIDQ1056201

David Q. Mayne, Elijah Polak

Publication date: 1982

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

zbMATH Keywords

quadratic rate of convergenceinfinite dimensional inequalities

Mathematics Subject Classification ID

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

Related Items (6)

An efficient algorithm for solving semi-infinite inequality problems with box constraints ⋮ Nonlinear robust optimization via sequential convex bilevel programming ⋮ A barrier function method for minimax problems ⋮ A parallel algorithm for semi-infinite programming ⋮ An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization ⋮ Outer approximation algorithm for nondifferentiable optimization problems

Cites Work

• Unnamed Item
• On the global stabilization of locally convergent algorithms
• An improved algorithm for optimization problems with functional inequality constraints
• An algorithm for optimization problems with functional inequality constraints
• Combined phase I—phase II methods of feasible directions

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