Lower level duality and the global solution of generalized semi-infinite programs
From MaRDI portal
Publication:2810114
DOI10.1080/02331934.2015.1127370zbMath1338.90316OpenAlexW2237289473MaRDI QIDQ2810114
Paul I. Barton, Stuart M. Harwood
Publication date: 31 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2015.1127370
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (3)
Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ How to solve a design centering problem ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
Cites Work
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Feasible method for generalized semi-infinite programming
- Semi-infinite programming
- Generalized semi-infinite programming: a tutorial
- Application of general semi-infinite programming to lapidary cutting problems
- On the closure of the feasible set in generalized semi-infinite programming
- Generalized semi-infinite programming: On generic local minimizers
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Applications of second-order cone programming
- Infinitely constrained optimization problems
- 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
- First-order optimality conditions in generalized semi-infinite programming
- Interval methods for semi-infinite programs
- A polyhedral branch-and-cut approach to global optimization
- Global solution of semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- On generalized semi-infinite optimization and bilevel optimization
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- How to solve a semi-infinite optimization problem
- Generalized semi-infinite programming: numerical aspects
- Global optimization of semi-infinite programs via restriction of the right-hand side
- A semi-infinite approach to design centering
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Introduction to Interval Analysis
- Relaxation-Based Bounds for Semi-Infinite Programs
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Solving generalized semi-infinite programs by reduction to simpler problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
This page was built for publication: Lower level duality and the global solution of generalized semi-infinite programs
