A New Exchange Method for Convex Semi-Infinite Programming

Numerical mathematical programming methods (65K05) Convex programming (90C25) Algorithms for approximation of functions (65D15) Semi-infinite programming (90C34)

Cited In (36)

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
Feasible Method for Semi-Infinite Programs
Recent advances in nonconvex semi-infinite programming: applications and algorithms
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
A noninterior point homotopy method for semi-infinite programming problems
An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems
A new exact penalty method for semi-infinite programming problems
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
Solving semi-infinite programs by smoothing projected gradient method
Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
On solving a class of linear semi-infinite programming by SDP method
On Exchange Methods for Nonlinear Semi-Infinite Programs
Optimization with a class of multivariate integral stochastic order constraints
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
On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
Marco A. López, a pioneer of continuous optimization in Spain
Existence of augmented Lagrange multipliers for semi-infinite programming problems
Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
Convergent Algorithms for a Class of Convex Semi-infinite Programs
An outer approximation algorithm for equilibrium problems in Hilbert spaces
An inexact primal-dual algorithm for semi-infinite programming
Recent contributions to linear semi-infinite optimization
A new adaptive method to nonlinear semi-infinite programming
Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
Optimality analysis of a class of semi-infinite programming problems
Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
Recent contributions to linear semi-infinite optimization: an update
Optimal control of nonlinear switched systems: computational methods and applications
Near-optimal solutions of convex semi-infinite programs via targeted sampling
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
Convex Optimization for Group Feature Selection in Networked Data

Uses Software

Matlab

This page was built for publication: A New Exchange Method for Convex Semi-Infinite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083316)