A dual algorithm for minimax problems
From MaRDI portal
Publication:1767399
DOI10.1007/BF02936065zbMath1138.90498MaRDI QIDQ1767399
Publication date: 10 March 2005
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)
Related Items (2)
A minimax model and arithmetic for initial emission permits ⋮ Uniform approximation of min/max functions by smooth splines
Cites Work
- A smooth method for the finite minimax problem
- An algorithm for composite nonsmooth optimization problems
- A barrier function method for minimax problems
- On the entropic regularization method for solving min-max problems with applications
- Superlinearly convergent algorithm for min-max problems
- Smooth Optimization Methods for Minimax Problems
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Exact penalty functions in nonlinear programming
- Combined lp and quasi-Newton methods for minimax optimization
- Nonlinear leastpth optimization and nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A dual algorithm for minimax problems
