A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
From MaRDI portal
Publication:4899022
DOI10.1137/110839631zbMATH Open1262.90177OpenAlexW2127304839MaRDI QIDQ4899022FDOQ4899022
Authors: Takayuki Okuno, Shunsuke Hayashi, Masao Fukushima 
Publication date: 4 January 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/160944
Recommendations
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- A new exchange method for convex semi-infinite programming
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Global solution of semi-infinite programs
- An exchange method with refined subproblems for convex semi-infinite programming problems
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Semi-infinite programming (90C34)
Cited In (12)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- On Exchange Methods for Nonlinear Semi-Infinite Programs
- Generalizations of doubly nonnegative cones and their comparison
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- An exchange method with refined subproblems for convex semi-infinite programming problems
- A new exchange method for convex semi-infinite programming
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- The regularized constraint aggregation method for a problem of semi-infinite optimization
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
This page was built for publication: A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899022)
