Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
From MaRDI portal
Publication:2274885
DOI10.1007/s10898-019-00764-3zbMath1428.90169OpenAlexW2938556754MaRDI QIDQ2274885
Alexander Mitsos, Hatim Djelassi, Moll Glass
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00764-3
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items (9)
Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Bilevel optimization for joint scheduling of production and energy systems ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Global solution of semi-infinite programs with existence constraints ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- 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
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- Infinitely constrained optimization problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Practical bilevel optimization. Algorithms and applications
- Nonlinear integer bilevel programming
- Bilevel and multilevel programming: A bibliography review
- Bi-level strategies in semi-infinite programming.
- Foundations of bilevel programming
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- Interval methods for semi-infinite programs
- A polyhedral branch-and-cut approach to global optimization
- Global solution of semi-infinite programs
- On the use of intersection cuts for bilevel optimization
- Generalized semi-infinite programming: Theory and methods
- On generalized semi-infinite optimization and bilevel optimization
- Robust optimization-methodology and applications
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Global solution of nonlinear mixed-integer bilevel programs
- How to solve a semi-infinite optimization problem
- Convex and concave relaxations of implicit functions
- 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
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- 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
- An algorithm for the integer linear fractional bilevel programming problem
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- The Mixed Integer Linear Bilevel Programming Problem
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Mathematical Programs with Optimization Problems in the Constraints
- Second-order optimality conditions in generalized semi-infinite programming
- On linear and linearized generalized semi-infinite optimization problems
This page was built for publication: Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
