The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets

DOI10.1007/s10107-012-0556-5zbMath1263.90106OpenAlexW2093847767MaRDI QIDQ1925776

Oliver Stein, Paul Steuermann

Publication date: 19 December 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0556-5

zbMATH Keywords

global optimizationconvex optimizationbilevel optimizationmathematical programming with complementarity constraints\(\alpha BB\)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)

Related Items (18)

A survey of nonlinear robust optimization ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Feasible Method for Semi-Infinite Programs ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ Dynamic optimization of state-dependent switched systems with free switching sequences ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ How to solve a semi-infinite optimization problem ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Convexification method for bilevel programs with a nonconvex Follower's problem ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization ⋮ MPEC Methods for Bilevel Optimization Problems

Uses Software

• INTLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting mathematical programs with complementarity constraints
• Global solution of bilevel programs with a nonconvex inner program
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
• Computing a global optimal solution to a design centering problem
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Optimization. Algorithms and consistent approximations
• Error bounds in mathematical programming
• Bi-level strategies in semi-infinite programming.
• Interval methods for semi-infinite programs
• Global solution of semi-infinite programs
• On generalized semi-infinite optimization and bilevel optimization
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• 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
• Interval Methods for Systems of Equations
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints

This page was built for publication: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets