A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
From MaRDI portal
Publication:4899022
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
Cited in
(12)- 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
- 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
- Generalizations of doubly nonnegative cones and their comparison
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- 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
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- On Exchange Methods for Nonlinear Semi-Infinite Programs
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)