A New Exchange Method for Convex Semi-Infinite Programming
From MaRDI portal
Publication:3083316
DOI10.1137/090767133zbMath1229.90247OpenAlexW2049355922MaRDI QIDQ3083316
Soon-Yi Wu, Marco A. López, Li-ping Zhang
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/75128
filter designconvex semi-infinite programmingexchange methodscomplex approximation theoryadding-dropping rules
Numerical mathematical programming methods (65K05) Convex programming (90C25) Semi-infinite programming (90C34) Algorithms for approximation of functions (65D15)
Related Items (35)
Existence of augmented Lagrange multipliers for semi-infinite programming problems ⋮ 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 ⋮ Feasible Method for Semi-Infinite Programs ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Optimization with a class of multivariate integral stochastic order constraints ⋮ Optimal control of nonlinear switched systems: computational methods and applications ⋮ An outer approximation algorithm for equilibrium problems in Hilbert spaces ⋮ Recent contributions to linear semi-infinite optimization ⋮ A new exact penalty method for semi-infinite programming problems ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ 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 ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ 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 ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ 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 ⋮ Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ A new adaptive method to nonlinear semi-infinite programming ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Uses Software
This page was built for publication: A New Exchange Method for Convex Semi-Infinite Programming
