A smoothing scheme for optimization problems with max-min constraints

DOI10.3934/JIMO.2007.3.209zbMATH Open1170.90489OpenAlexW2045596796MaRDI QIDQ2469792FDOQ2469792

Authors: Xuexiang Huang, Xiao Qi Yang, Kok Lay Teo 

Publication date: 11 February 2008

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2007.3.209

Recommendations

• A smoothing algorithm for finite min-max-min problems
• scientific article; zbMATH DE number 2068041
• Smoothing method for minimax problems
• Uniform approximation of min/max functions by smooth splines
• On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems

zbMATH Keywords

convergencemin-max-min problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Cited In (11)

• Uniform approximation of min/max functions by smooth splines
• Title not available (Why is that?)
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
• Fiscal centralization vs. decentralization on economic growth and welfare: an optimal-control approach
• Smooth Optimization Methods for Minimax Problems
• A smoothing algorithm for finite min-max-min problems
• Incremental gradient-free method for nonsmooth distributed optimization
• Title not available (Why is that?)
• A variable smoothing algorithm for solving convex optimization problems
• Title not available (Why is that?)

This page was built for publication: A smoothing scheme for optimization problems with max-min constraints

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