A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
From MaRDI portal
Publication:1938906
DOI10.1007/s10589-012-9489-4zbMath1267.90159OpenAlexW1970596092MaRDI QIDQ1938906
Oliver Stein, Paul Steuermann, Moritz Diehl, Boris Houska
Publication date: 25 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9489-4
mathematical program with complementarity constraintssemi-infinite optimizationadaptive convexificationlifting approachlower level duality
Related Items
Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ How to solve a design centering problem ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ A collision detection approach for maximizing the material utilization ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ How to solve a semi-infinite optimization problem ⋮ Backward-forward reachable set splitting for state-constrained differential games ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ MPEC Methods for Bilevel Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feasible method for generalized semi-infinite programming
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- On the closure of the feasible set in generalized semi-infinite programming
- Global solution of bilevel programs with a nonconvex inner program
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Optimization. Algorithms and consistent approximations
- Bi-level strategies in semi-infinite programming.
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- How to solve a semi-infinite optimization problem
- On generalized semi-infinite optimization of genetic networks
- Generalized semi-infinite programming: numerical aspects
- Robust Convex Optimization
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
- Discretization in semi-infinite programming: the rate of convergence
