An exchange method with refined subproblems for convex semi-infinite programming problems
From MaRDI portal
Recommendations
- A new exchange method for convex semi-infinite programming
- Some outer approximation methods for semi-infinite optimization problems
- On Exchange Methods for Nonlinear Semi-Infinite Programs
- An efficient algorithm for - convex semi-infinite programming problems
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
Cites work
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A dual parametrization method for convex semi-infinite programming
- A new exchange method for convex semi-infinite programming
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- A semi-infinite programming approach to identifying matrix-exponential distributions
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- An iterative method for solving KKT system of the semi-infinite programming
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Discretization in semi-infinite programming: the rate of convergence
- Discretization methods for the solution of semi-infinite programming problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Penalty and smoothing methods for convex semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- The semismooth approach for semi-infinite programming under the reduction ansatz
Cited in
(10)- An efficient algorithm for - convex semi-infinite programming problems
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- A noninterior point homotopy method for semi-infinite programming problems
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
- On Exchange Methods for Nonlinear Semi-Infinite Programs
- A new exchange method for convex semi-infinite programming
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
This page was built for publication: An exchange method with refined subproblems for convex semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829588)
