Some outer approximation methods for semi-infinite optimization problems
From MaRDI portal
Publication:1343650
DOI10.1016/0377-0427(92)00122-PzbMath0828.65069MaRDI QIDQ1343650
Publication date: 10 January 1996
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergencecutting plane methodsouter approximation methodsconvex semi-infinite programsexchange methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Semi-infinite programming (90C34)
Related Items (12)
A survey of nonlinear robust optimization ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Scenario approximation of robust and chance-constrained programs ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming ⋮ Logarithmic Barrier Decomposition Methods for Semi-infinite Programming ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems ⋮ A multi-local optimization algorithm ⋮ Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems ⋮ A globally most violated cutting plane method for complex minimax problems with application to digital filter design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of a class of outer approximation algorithms for convex programs
- A one-phase algorithm for semi-infinite linear programming
- A note on an implementation of a method for quadratic semi-infinite programming
- Newton's method for convex programming and Tschebyscheff approximation
- A cutting-plane algorithm with linear and geometric rates of convergence
- A cutting plane method for solving minimax problems in the complex plane
- Infinitely constrained optimization problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Discretization methods for the solution of semi-infinite programming problems
- On cutoff optimization methods in infinite-dimensional spaces and applications
- The Cutting-Plane Method for Solving Convex Programs
- Modifications of the First Remez Algorithm
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- An implementation of a discretization method for semi-infinite programming
- A cutting-plane method for quadratic semi infinite programming problems
- An Outer Approximation Algorithm for Solving General Convex Programs
- Discrete approximations of minimization problems. I. Theory
- A central cutting plane algorithm for the convex programming problem
- Approximate cutting planes in nonlinear programming
- Computational aspects of cutting-plane algorithms for geometric programming problems
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- Applications of a general convergence theory for outer approximation algorithms
- Numerical treatment of a class of semi‐infinite programming problems
- The Supporting Hyperplane Method for Unimodal Programming
- Cutting-Plane Methods without Nested Constraint Sets
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
This page was built for publication: Some outer approximation methods for semi-infinite optimization problems
