Feasible method for generalized semi-infinite programming

DOI10.1007/s10957-010-9674-5zbMath1202.90256OpenAlexW2034728596MaRDI QIDQ604267

Anton Winterfeld, Oliver Stein

Publication date: 10 November 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9674-5

zbMATH Keywords

bilevel programmingmathematical program with equilibrium constraintsdesign centering

Mathematics Subject Classification ID

Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items

Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Feasible Method for Semi-Infinite Programs, How to solve a design centering problem, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, Non-convex semi-infinite min-max optimization with noncompact sets, An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, Global optimization of generalized semi-infinite programs via restriction of the right hand side, Global optimization of generalized semi-infinite programs using disjunctive programming, How to solve a semi-infinite optimization problem, Lower level duality and the global solution of generalized semi-infinite programs, Interior point filter method for semi-infinite programming problems, MPEC Methods for Bilevel Optimization Problems

Uses Software

• alphaBB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting mathematical programs with complementarity constraints
• Generalized semi-infinite programming: a tutorial
• Nonlinear optimization: Characterization of structural stability
• A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
• On NCP-functions
• A smoothing method for mathematical programs with equilibrium constraints
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Bi-level strategies in semi-infinite programming.
• A modified relaxation scheme for mathematical programs with complementarity constraints
• Global solution of semi-infinite programs
• Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
• On generalized semi-infinite optimization and bilevel optimization
• Smoothing methods for convex inequalities and linear complementarity problems
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A semi-infinite approach to design centering
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• Engineering and Economic Applications of Complementarity Problems
• Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Lower-order penalty methods for mathematical programs with complementarity constraints