Global solution of semi-infinite programs with existence constraints
From MaRDI portal
Publication:2031944
DOI10.1007/s10957-021-01813-2zbMath1469.90151OpenAlexW3127671907MaRDI QIDQ2031944
Alexander Mitsos, Hatim Djelassi
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01813-2
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 (4)
Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
Uses Software
Cites Work
- Unnamed Item
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Semi-infinite programming
- Generalized semi-infinite programming: a tutorial
- A smoothing algorithm for finite min-max-min problems
- Infinitely constrained optimization problems
- Adjustable robust solutions of uncertain linear programs
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- How to solve a semi-infinite optimization problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Adjustable robust optimization models for a nonlinear two-period system
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- A hybrid algorithm for infinitely constrained optimization
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- A nonconvex max-min problem
- Robust capacity expansion of network flows
This page was built for publication: Global solution of semi-infinite programs with existence constraints
