A smoothing algorithm for finite min-max-min problems

DOI10.1007/s11590-008-0090-9zbMath1154.90619OpenAlexW2000422349MaRDI QIDQ1001326

Angelos Tsoukalas, Berc Rustem, Panos Parpas

Publication date: 17 February 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0090-9

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items (7)

A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems ⋮ On the information-based complexity of stochastic programming ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Hyperbolic smoothing function method for minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Laplace's method revisited: Weak convergence of probability measures
• An outer approximations algorithm for computer-aided design problems
• Optimization. Algorithms and consistent approximations
• Thevenin decomposition and large-scale optimization
• Smoothing method for minimax problems

This page was built for publication: A smoothing algorithm for finite min-max-min problems