An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
From MaRDI portal
Publication:3586147
Recommendations
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- A new exchange method for convex semi-infinite programming
- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems
- Global solution of semi-infinite programs
Cited in
(7)- A new exchange method for convex semi-infinite programming
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- An exchange method with refined subproblems for convex semi-infinite programming problems
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
This page was built for publication: An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586147)