Relaxation-Based Bounds for Semi-Infinite Programs
From MaRDI portal
Publication:3608973
DOI10.1137/060674685zbMath1163.90035OpenAlexW2022234361MaRDI QIDQ3608973
Panayiotis Lemonidis, Cha Kun Lee, Alexander Mitsos, Paul I. Barton
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060674685
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 (29)
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ 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 ⋮ 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 ⋮ An algorithm for semi-infinite polynomial optimization ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ 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 feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ Min-max and robust polynomial optimization ⋮ Convergence rate of McCormick relaxations ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ How to solve a semi-infinite optimization problem ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems ⋮ MPEC Methods for Bilevel Optimization Problems
This page was built for publication: Relaxation-Based Bounds for Semi-Infinite Programs
