Convergent Algorithms for a Class of Convex Semi-infinite Programs
From MaRDI portal
Publication:5043283
DOI10.1137/21M1431047zbMath1504.90171OpenAlexW4221144551MaRDI QIDQ5043283
Leo Liberti, Claudia D'Ambrosio, Martina Cerulli, Antoine Oustry
Publication date: 21 October 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1431047
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- Infinitely constrained optimization problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Discretization methods for the solution of semi-infinite programming problems
- Bi-level strategies in semi-infinite programming.
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Global solution of semi-infinite programs
- New results in subdifferential calculus with applications to convex optimization
- An interior-point method for semi-infinite programming problems
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Global solution of semi-infinite programs with existence constraints
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Lectures on Modern Convex Optimization
- A New Exchange Method for Convex Semi-Infinite Programming
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Cutting-Plane Method for Solving Convex Programs
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- A projected lagrangian algorithm for semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- A cutting-plane method for quadratic semi infinite programming problems
- An algorithm of successive minimization in convex programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A regularized penalty method for solving convex semi-infinite programs
- Variational Analysis
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Semidefinite Programming
- Understanding Analysis
- Convex analysis and global optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Discretization in semi-infinite programming: the rate of convergence
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
