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




Related Items (28)

The CoMirror algorithm with random constraint sampling for convex semi-infinite programmingA feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programmingConvergent Algorithms for a Class of Convex Semi-infinite ProgramsConstrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problemsA logarithmic barrier cutting plane method for convex programmingComputation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic caseA globally convergent method for semi-infinite linear programmingAn outer approximation algorithm for equilibrium problems in Hilbert spacesAn entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problemsA modified exchange algorithm for distributional robust optimization and applications in risk managementSemi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite ProgrammingDecomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression modelsA proximal bundle method for constrained nonsmooth nonconvex optimization with inexact informationAn infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problemsOn the numerical treatment of linearly constrained semi-infinite optimization problemsSolving semi-infinite programs by smoothing projected gradient methodA discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methodsLearning Data Manifolds with a Cutting Plane MethodRelaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problemsA multiperiod planning model for communications satellitesAn accelerated central cutting plane algorithm for linear semi-infinite programmingLogarithmic Barrier Decomposition Methods for Semi-infinite ProgrammingAn exchange method with refined subproblems for convex semi-infinite programming problemsAn inexact primal-dual algorithm for semi-infinite programmingDistributionally robust resource planning under binomial demand intakesOn Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact OracleA smoothing Levenberg-Marquardt algorithm for semi-infinite programmingA 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