A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
From MaRDI portal
Recommendations
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- scientific article; zbMATH DE number 3984967
- A cutting-plane method for quadratic semi infinite programming problems
- A one-phase algorithm for semi-infinite linear programming
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
Cited in
(37)- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A cutting-plane method for quadratic semi infinite programming problems
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Some outer approximation methods for semi-infinite optimization problems
- Distributionally robust resource planning under binomial demand intakes
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- A dual parameterization approach to linear-quadratic semi-infinite programming problems
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Application of general semi-infinite programming to lapidary cutting problems
- A logarithmic barrier cutting plane method for convex programming
- Analytic center based cutting plane method for linear semi-infinite programming.
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Solving semi-infinite programs by smoothing projected gradient method
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- An exchange method with refined subproblems for convex semi-infinite programming problems
- Learning data manifolds with a cutting plane method
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- An outer approximation algorithm for equilibrium problems in Hilbert spaces
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An inexact primal-dual algorithm for semi-infinite 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
- A multiperiod planning model for communications satellites
- Cutting plane algorithms for robust conic convex optimization problems
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- scientific article; zbMATH DE number 3984967 (Why is no real title available?)
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for publication: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277519)
