Pages that link to "Item:Q1001326"
From MaRDI portal
The following pages link to A smoothing algorithm for finite min-max-min problems (Q1001326):
Displaying 15 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques (Q597183) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- Solving minimax problems: local smoothing versus global smoothing (Q1627481) (← links)
- A dual algorithm for minimax problems (Q1767399) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- Pattern search methods for finite minimax problems (Q2380874) (← links)
- On the information-based complexity of stochastic programming (Q2450744) (← links)
- A smoothing scheme for optimization problems with max-min constraints (Q2469792) (← links)
- Hyperbolic smoothing function method for minimax problems (Q2841156) (← links)
- (Q3491338) (← links)
- A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems (Q5372650) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)