A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
From MaRDI portal
Recommendations
- A compact variable metric algorithm for nonlinear minimax approximation
- A new algorithm for the solution of the linear minimax approximation problem
- scientific article; zbMATH DE number 3956831
- scientific article; zbMATH DE number 5027086
- A direct method of linearization for continuous minimax problems
Cited in
(15)- An effective linearizing method for the specific nonlinear minimax optimization problem
- scientific article; zbMATH DE number 17727 (Why is no real title available?)
- Discontinuous piecewise linear optimization
- Algorithms with adaptive smoothing for finite minimax problems
- scientific article; zbMATH DE number 903122 (Why is no real title available?)
- scientific article; zbMATH DE number 93109 (Why is no real title available?)
- An efficient approach to nonlinear minimax problems
- The continuous quadrant penalty formulation of logical constraints
- A new algorithm for the solution of the linear minimax approximation problem
- Solving linear programming problems via linear minimax problems
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- Computational aspects of general minimax optimization
- scientific article; zbMATH DE number 3956831 (Why is no real title available?)
- scientific article; zbMATH DE number 3994940 (Why is no real title available?)
- A compact variable metric algorithm for nonlinear minimax approximation
This page was built for publication: A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018393)