An efficient algorithm for solving semi-infinite inequality problems with box constraints

DOI10.1007/BF01189451zbMath0820.90109MaRDI QIDQ1334924

Elijah Polak, David Q. Mayne, Hannah Michalska

Publication date: 26 September 1994

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

zbMATH Keywords

outer approximation algorithmsemi-infinite constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items

A multi-local optimization algorithm

Cites Work

• A quadratically convergent algorithm for solving infinite dimensional inequalities
• Solving nonlinear inequalities in a finite number of iterations
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• A barrier function method for minimax problems
• An outer approximations algorithm for computer-aided design problems
• Finite-termination schemes for solving semi-infinite satisfycing problems
• Outer approximation algorithm for nondifferentiable optimization problems
• Superlinearly convergent algorithm for min-max problems
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• Unnamed Item
• Unnamed Item