Solving minimax problems: local smoothing versus global smoothing

DOI10.1007/978-3-319-90026-1_2zbMATH Open1429.90093OpenAlexW2805239183MaRDI QIDQ1627481FDOQ1627481

Authors: N. Sultanova, A. Al Nuaimat, A. M. Bagirov, Sona Taheri 

Publication date: 30 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90026-1_2

Recommendations

• Smoothing method for minimax problems
• Local optima smoothing for global optimization
• Smooth Optimization Methods for Minimax Problems
• scientific article; zbMATH DE number 2068041
• A smooth method for the finite minimax problem
• A smoothing iterative method for the finite minimax problem
• Global minimization for problems with multiple local minima
• scientific article; zbMATH DE number 3911152
• scientific article
• A smoothing algorithm for finite min-max-min problems

zbMATH Keywords

nonlinear programmingminimax problemsnonsmooth optimizationsmoothing techniques

Mathematics Subject Classification ID

Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Cited In (7)

• Hyperbolic smoothing function method for minimax problems
• On a new smoothing technique for non-smooth, non-convex optimization
• On solving large-scale finite minimax problems using exponential smoothing
• Local optima smoothing for global optimization
• Pattern search methods for finite minimax problems
• Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
• On smooth reformulations and direct non-smooth computations for minimax problems

This page was built for publication: Solving minimax problems: local smoothing versus global smoothing

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