Lower level duality and the global solution of generalized semi-infinite programs

DOI10.1080/02331934.2015.1127370MaRDI QIDQ2810114zbMATH OpenOpenAlexFDO

Authors Stuart M. Harwood, Paul I. Barton

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

zbMATH Keywords

dualityglobal optimizationsemi-infinite programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
• Generalized semi-infinite programming: Theory and methods
• Generalized semi-infinite programming: numerical aspects
• Generalized semi-infinite programming: a tutorial
• The semismooth approach for semi-infinite programming under the reduction ansatz

Cites work

• A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
• A polyhedral branch-and-cut approach to global optimization
• A semi-infinite approach to design centering
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Application of general semi-infinite programming to lapidary cutting problems
• Applications of second-order cone programming
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Feasible method for generalized semi-infinite programming
• First-order optimality conditions in generalized semi-infinite programming
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Generalized semi-infinite programming: a tutorial
• Generalized semi-infinite programming: numerical aspects
• Generalized semi-infinite programming: On generic local minimizers
• Generalized semi-infinite programming: Theory and methods
• Global optimization of generalized semi-infinite programs via restriction of the right hand side
• Global optimization of semi-infinite programs via restriction of the right-hand side
• Global solution of semi-infinite programs
• How to solve a semi-infinite optimization problem
• Infinitely constrained optimization problems
• Interval methods for semi-infinite programs
• Introduction to Interval Analysis
• Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
• On generalized semi-infinite optimization and bilevel optimization
• On the closure of the feasible set in generalized semi-infinite programming
• Relaxation-Based Bounds for Semi-Infinite Programs
• Semi-infinite programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Solving generalized semi-infinite programs by reduction to simpler problems
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming

Cited in

(5)

• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
• How to solve a design centering problem
• Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
• Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
• Polynomial optimization relaxations for generalized semi-infinite programs

This page was built for publication: Lower level duality and the global solution of generalized semi-infinite programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810114)