Global optimization of semi-infinite programs via restriction of the right-hand side
From MaRDI portal
Publication:3111137
DOI10.1080/02331934.2010.527970zbMath1231.90361OpenAlexW1974300932MaRDI QIDQ3111137
Publication date: 18 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.527970
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items (28)
Integration of expert knowledge into radial basis function surrogate models ⋮ 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 ⋮ Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ Feasible Method for Semi-Infinite Programs ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Optimal deterministic algorithm generation ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ How to solve a design centering problem ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Dynamic optimization of state-dependent switched systems with free switching sequences ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ 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 ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ How to solve a semi-infinite optimization problem ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ 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 ⋮ Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ On sample average approximation for two-stage stochastic programs without relatively complete recourse
Uses Software
Cites Work
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- Generalized semi-infinite programming: a tutorial
- Global solution of bilevel programs with a nonconvex inner program
- Infinitely constrained optimization problems
- Interval methods for semi-infinite programs
- A polyhedral branch-and-cut approach to global optimization
- Global solution of semi-infinite programs
- On generalized semi-infinite optimization and bilevel optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Global solution of nonlinear mixed-integer bilevel programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- McCormick-Based Relaxations of Algorithms
- Relaxation-Based Bounds for Semi-Infinite Programs
This page was built for publication: Global optimization of semi-infinite programs via restriction of the right-hand side
