An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
From MaRDI portal
Publication:3586147
DOI10.1137/070710470zbMath1213.90248OpenAlexW2055428607MaRDI QIDQ3586147
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2bf5ab4a957072fa09b4b005fa5aada26a97fef5
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Semi-infinite programming (90C34)
Related Items (5)
Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ 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
Uses Software
This page was built for publication: An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
