Finite-termination schemes for solving semi-infinite satisfycing problems

DOI10.1007/BF00941296zbMath0793.90087OpenAlexW2037138829MaRDI QIDQ1321073

Elijah Polak, Limin He

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

outer approximationadaptive uniform discretizationsatisfycing problemsemi-infinite inequalities

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (2)

An efficient algorithm for solving semi-infinite inequality problems with box constraints ⋮ Multistart method with estimation scheme for global satisfycing problems

Cites Work

• Unnamed Item
• A comparative study of several semi-infinite nonlinear programming algorithms
• Outer approximation algorithm for nondifferentiable optimization problems
• Effective diagonalization strategies for the solution of a class of optimal design problems
• A mathematical basis for satisficing decision making
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• On the rate of convergence of certain methods of centers

This page was built for publication: Finite-termination schemes for solving semi-infinite satisfycing problems