Global optimization of generalized semi-infinite programs using disjunctive programming
From MaRDI portal
Publication:670652
DOI10.1007/s10898-018-0690-6zbMath1417.90141OpenAlexW2883225263MaRDI QIDQ670652
Publication date: 18 March 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0690-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items
A transformation-based discretization method for solving general semi-infinite optimization problems, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
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 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
- On the closure of the feasible set in generalized semi-infinite programming
- Optimal centered forms
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- Infinitely constrained optimization problems
- A note on duality in disjunctive programming
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- PROFIL/BIAS - A fast interval library
- Global optimization of disjunctive programs
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- How to solve a semi-infinite optimization problem
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Generalized semi-infinite programming: numerical aspects
- Disjunctive Cuts for Nonconvex MINLP
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Interval Methods for Systems of Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
