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

DOI10.1007/BF01189451MaRDI QIDQ1334924zbMATH OpenFDO

Authors D. Q. Mayne, Elijah Polak, 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)

Recommendations

• An algorithm for solving convex programs subject to box constraints
• scientific article; zbMATH DE number 2109125
• A new algorithm for the general quadratic programming problems with box constraints
• A feasible direction method for the semidefinite program with box constraints
• A convergent decomposition method for box-constrained optimization problems
• scientific article; zbMATH DE number 1059220
• A differential equation method for solving box constrained variational inequality problems
• A new bounding algorithm for solving Lipschitz optimization problem with box constraints
• scientific article; zbMATH DE number 2153290
• On Linear Semi-Infinite Programming Problems: An Algorithm

Cites work

• scientific article; zbMATH DE number 3755766 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• A barrier function method for minimax problems
• A quadratically convergent algorithm for solving infinite dimensional inequalities
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• An outer approximations algorithm for computer-aided design problems
• Finite-termination schemes for solving semi-infinite satisfycing problems
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• Outer approximation algorithm for nondifferentiable optimization problems
• Solving nonlinear inequalities in a finite number of iterations
• Superlinearly convergent algorithm for min-max problems

Cited in

(4)

• A stochastic algorithm for optimization problems with continua of inequalities
• A multi-local optimization algorithm
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• Stochastic algorithm for solving convex semi-infinite problem with equality and inequality constraints

This page was built for publication: An efficient algorithm for solving semi-infinite inequality problems with box constraints

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