Variable programming: a generalized minimax problem. II: Algorithms

DOI10.1007/S10589-005-4617-ZzbMath1078.90050OpenAlexW1970258741MaRDI QIDQ2488054

Yanyan Li

Publication date: 23 August 2005

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-4617-z

zbMATH Keywords

minimaxsmooth optimizationstatistical mechanics principlevariable programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29)

Related Items (4)

Optimality conditions for nondifferentiable minimax programs and vector optimization problems ⋮ The optimality conditions for generalized minimax programming ⋮ A nonmonotone line search based algorithm for distribution center location selected ⋮ Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A smooth method for the finite minimax problem
• An efficient approach to nonlinear minimax problems
• An efficient approach to a class of non-smooth optimization problems
• On the entropic regularization method for solving min-max problems with applications
• Variable programming: a generalized minimax problem. I: Models and theory
• Smooth Optimization Methods for Minimax Problems
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• Smoothing method for minimax problems

This page was built for publication: Variable programming: a generalized minimax problem. II: Algorithms