An exchange method with refined subproblems for convex semi-infinite programming problems
From MaRDI portal
Publication:2829588
DOI10.1080/10556788.2015.1124432zbMath1355.90100OpenAlexW2303009999MaRDI QIDQ2829588
Kensuke Gomoto, Shunsuke Hayashi, Takayuki Okuno, Nobuo Yamashita
Publication date: 8 November 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1124432
Related Items (6)
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 ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
Cites Work
- Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- The semismooth approach for semi-infinite programming under the reduction ansatz
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Discretization methods for the solution of semi-infinite programming problems
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- An iterative method for solving KKT system of the semi-infinite programming
- An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
- On Linear Semi-Infinite Programming Problems: An Algorithm
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- 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
- A dual parametrization method for convex semi-infinite programming
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: An exchange method with refined subproblems for convex semi-infinite programming problems
