The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
From MaRDI portal
Publication:3544257
DOI10.1137/060657741zbMath1216.90094OpenAlexW2038589630MaRDI QIDQ3544257
Oliver Stein, Christodoulos A. Floudas
Publication date: 5 December 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060657741
global optimizationconvex optimizationsemi-infinite programmingbilevel optimizationmathematical program 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)
Related Items
EAGO.jl: easy advanced global optimization in Julia, A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, Convergent Algorithms for a Class of Convex Semi-infinite Programs, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Towards rigorous robust optimal control via generalized high-order moment expansion, Feasible Method for Semi-Infinite Programs, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, A transformation-based discretization method for solving general semi-infinite optimization problems, Feasible method for generalized semi-infinite programming, Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, 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, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Nonlinear robust optimization via sequential convex bilevel programming, A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming, Global solution of nonlinear mixed-integer bilevel programs, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, The semismooth approach for semi-infinite programming under the reduction ansatz, Solving semi-infinite programs by smoothing projected gradient method, Smoothing by mollifiers. I: Semi-infinite optimization, 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, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, How to solve a semi-infinite optimization problem, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, Efficient shape optimization for certain and uncertain aerodynamic design, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, On the treatment of distributed uncertainties in PDE-constrained optimization, A standard branch-and-bound approach for nonlinear semi-infinite problems, 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, Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints, Lower level duality and the global solution of generalized semi-infinite programs, Global solution of bilevel programs with a nonconvex inner program, Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods, Global optimization of semi-infinite programs via restriction of the right-hand side, A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing, MPEC Methods for Bilevel Optimization Problems
Uses Software
