Min-Max-Min Optimization with Smooth and Strongly Convex Objectives

DOI10.1137/22M1489940MaRDI QIDQ6053591zbMATH OpenFDO

Authors Jourdain B. Lamperski, Oleg A. Prokopyev

Publication date 27 September 2023

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1489940

zbMATH Keywords

\(k\)-center problemapproximation algorithmsconvex optimizationmin-max-min optimizationrobust optimization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A smoothing scheme for optimization problems with max-min constraints
• A smoothing algorithm for finite min-max-min problems
• Min-max optimization of several classical discrete optimization problems
• scientific article; zbMATH DE number 444984
• Uniform approximation of min/max functions by smooth splines

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A heuristic for the p-center problem in graphs
• A simple heuristic for the p-centre problem
• Adjustable robust solutions of uncertain linear programs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Clustering to minimize the maximum intercluster distance
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
• Convex optimization: algorithms and complexity
• Design of near optimal decision rules in multistage adaptive mixed-integer optimization
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
• Finite Adaptability in Multistage Linear Optimization
• scientific article; zbMATH DE number 4099005 (Why is no real title available?)
• scientific article; zbMATH DE number 1757943 (Why is no real title available?)
• scientific article; zbMATH DE number 780787 (Why is no real title available?)
• scientific article; zbMATH DE number 871893 (Why is no real title available?)
• Improved Combinatorial Algorithms for Facility Location Problems
• Min max min robust (relative) regret combinatorial optimization
• Min-max-min robust combinatorial optimization
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
• Multistage robust mixed-integer optimization with adaptive partitions
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
• On the Complexity of Some Common Geometric Location Problems
• On the power and limitations of affine policies in two-stage adaptive optimization
• Optimality of affine policies in multistage robust optimization
• Robust discrete optimization and its applications
• Robust optimization
• Theory and applications of robust optimization

Cited in

(5)

• On the oracle complexity of smooth strongly convex minimization
• scientific article; zbMATH DE number 4164577 (Why is no real title available?)
• Smooth Optimization Methods for Minimax Problems
• scientific article; zbMATH DE number 1421256 (Why is no real title available?)
• Optimal Affine-Invariant Smooth Minimization Algorithms

This page was built for publication: Min-Max-Min Optimization with Smooth and Strongly Convex Objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053591)