A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
From MaRDI portal
Publication:4277519
DOI10.1137/0803047zbMath0790.90070OpenAlexW1983611387MaRDI QIDQ4277519
No author found.
Publication date: 23 June 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803047
linear semi-infinite programminglinear convergence ratecomplex approximation theoryautomatic grid refinementcentral cutting plane algorithmconstraint-dropping rules
Convex programming (90C25) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (28)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ A logarithmic barrier cutting plane method for convex programming ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ A globally convergent method for semi-infinite linear programming ⋮ An outer approximation algorithm for equilibrium problems in Hilbert spaces ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ Learning Data Manifolds with a Cutting Plane Method ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ A multiperiod planning model for communications satellites ⋮ An accelerated central cutting plane algorithm for linear semi-infinite programming ⋮ Logarithmic Barrier Decomposition Methods for Semi-infinite Programming ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Distributionally robust resource planning under binomial demand intakes ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming ⋮ A dual parameterization approach to linear-quadratic semi-infinite programming problems
This page was built for publication: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
