A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
type: Item
instance of: scholarly article
title: A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
zbMATH Open document ID: 1267.90159
author: Oliver Stein
author: Paul Steuermann
author: Moritz Diehl
author: Boris Houska
published in: Computational Optimization and Applications
publication date: 2013-02-25T00:00:00Z
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6138709
zbMATH Keywords: semi-infinite optimization
zbMATH Keywords: lower level duality
zbMATH Keywords: lifting approach
zbMATH Keywords: adaptive convexification
zbMATH Keywords: mathematical program with complementarity constraints
MaRDI profile type: Publication
full work available at URL: s10589-012-9489-4
OpenAlex ID: W1970596092
cites work: Robust convex optimization
cites work: Q3182207
cites work: Interval methods for semi-infinite programs
cites work: Global solution of semi-infinite programs
cites work: A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: On the closure of the feasible set in generalized semi-infinite programming
cites work: General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
cites work: Q4161092
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Q3939127
cites work: Generalized semi-infinite optimization: A first order optimality condition and examples
cites work: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: Optimization. Algorithms and consistent approximations
cites work: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
cites work: Q3840143
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
cites work: Bi-level strategies in semi-infinite programming.
cites work: How to solve a semi-infinite optimization problem
cites work: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cites work: Solving Semi-Infinite Optimization Problems with Interior Point Techniques
cites work: Feasible method for generalized semi-infinite programming
cites work: Discretization in semi-infinite programming: the rate of convergence
cites work: Generalized semi-infinite programming: numerical aspects
cites work: On generalized semi-infinite optimization of genetic networks
DOI: 10.1007/S10589-012-9489-4
description: scientific article; zbMATH DE number 6138709