A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
From MaRDI portal
Publication:839044
DOI10.1007/s10898-008-9321-yzbMath1178.90329OpenAlexW1964986866MaRDI QIDQ839044
Angelos Tsoukalas, Efstratios N. Pistikopoulos, Berc Rustem
Publication date: 1 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9321-y
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items (27)
Solving quality control problems with an algorithm for minimax programs with coupled constraints ⋮ A linear ordering problem of sets ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ How to solve a design centering problem ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Worst-case global optimization of black-box functions through Kriging and relaxation ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Bilevel optimization for joint scheduling of production and energy systems ⋮ Continuous models combining slacks-based measures of efficiency and super-efficiency ⋮ Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming ⋮ Particle swarm optimization for bi-level pricing problems in supply chains ⋮ 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 ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities ⋮ A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
Cites Work
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- Linearly constrained global optimization and stochastic differential equations
- Application of general semi-infinite programming to lapidary cutting problems
- A smoothing algorithm for finite min-max-min problems
- Global solution of bilevel programs with a nonconvex inner program
- An algorithm for the global optimization of a class of continuous minimax problems
- Infinitely constrained optimization problems
- Semi-infinite programming and applications to minimax problems
- Global optimization issues in multiparametric continuous and mixed-integer optimization problems
- Global solution of semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- A direct method of linearization for continuous minimax problems
- On generalized semi-infinite optimization and bilevel optimization
- Convergence of an interior point algorithm for continuous minimax
- Parametric global optimisation for bilevel programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- Finding saddle points on polyhedra: Solving certain continuous minimax problems
- 10.1162/153244303321897726
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
