A quadratically convergent algorithm for solving infinite dimensional inequalities

DOI10.1007/BF01460116zbMATH Open0522.65045MaRDI QIDQ1056201FDOQ1056201

Authors: D. Q. Mayne, Elijah Polak 

Publication date: 1982

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

zbMATH Keywords

infinite dimensional inequalitiesquadratic rate of convergence

Mathematics Subject Classification ID

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

Cites Work

• 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
• On the global stabilization of locally convergent algorithms
• Title not available (Why is that?)

Cited In (6)

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

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)