The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
DOI10.1007/S10107-012-0556-5zbMATH Open1263.90106OpenAlexW2093847767MaRDI QIDQ1925776FDOQ1925776
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
Recommendations
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Feasible method for semi-infinite programs
- scientific article; zbMATH DE number 3936944
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Feasible method for generalized semi-infinite programming
convex optimizationglobal optimizationbilevel optimizationmathematical programming with complementarity constraints\(\alpha BB\)
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)
Cites Work
- Optimization. Algorithms and consistent approximations
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Title not available (Why is that?)
- Global solution of bilevel programs with a nonconvex inner program
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Error bounds in mathematical programming
- Bi-level strategies in semi-infinite programming.
- On generalized semi-infinite optimization and bilevel optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Global solution of semi-infinite programs
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Lifting mathematical programs with complementarity constraints
- Interval methods for semi-infinite programs
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Computing a global optimal solution to a design centering problem
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Title not available (Why is that?)
Cited In (20)
- On solving a class of fractional semi-infinite polynomial programming problems
- Feasible Method for Semi-Infinite Programs
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
- MPEC Methods for Bilevel Optimization Problems
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Global solution of semi-infinite programs with existence constraints
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Title not available (Why is that?)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Dynamic optimization of state-dependent switched systems with free switching sequences
- How to solve a semi-infinite optimization problem
- Global optimization of generalized semi-infinite programs using disjunctive programming
- A survey of nonlinear robust optimization
Uses Software
This page was built for publication: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925776)
