A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
From MaRDI portal
Publication:1675550
DOI10.1007/s10898-016-0476-7zbMath1380.90267OpenAlexW2548706375MaRDI QIDQ1675550
Hatim Djelassi, Alexander Mitsos
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0476-7
Related Items (9)
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Global solution of semi-infinite programs with existence constraints
Uses Software
Cites Work
- Unnamed Item
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Feasible method for generalized semi-infinite programming
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- 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
- BARON: A general purpose global optimization software package
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Global solution of nonlinear mixed-integer bilevel programs
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- A semi-infinite approach to design centering
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
This page was built for publication: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
