An accelerated central cutting plane algorithm for linear semi-infinite programming
From MaRDI portal
Publication:1764241
DOI10.1007/s10107-003-0492-5zbMath1073.90053OpenAlexW2101508998MaRDI QIDQ1764241
Publication date: 24 February 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0492-5
Related Items (19)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Generalized moment theory and Bayesian robustness analysis for hierarchical mixture models ⋮ Shape constrained risk-neutral density estimation by support vector regression ⋮ A ladder method for linear semi-infinite programming ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Recent contributions to linear semi-infinite optimization ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ Solving a continuous local access network design problem with a stabilized central column generation approach ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Numerical treatment of Bayesian robustness problems ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ A proximal cutting plane method using Chebychev center for nonsmooth convex optimization ⋮ On solving a class of linear semi-infinite programming by SDP method ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ Chebyshev center based column generation ⋮ A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing ⋮ An inexact primal-dual algorithm for semi-infinite programming
Uses Software
Cites Work
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- A one-phase algorithm for semi-infinite linear programming
- A purification algorithm for semi-infinite programming
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Design of optimal linear phase FIR filters by a semi-infinite programming technique
- A logarithmic barrier cutting plane method for convex programming
- A central cutting plane algorithm for the convex programming problem
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Methods for Global Prior Robustness under Generalized Moment Conditions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An accelerated central cutting plane algorithm for linear semi-infinite programming
