A projected conjugate gradient method for sparse minimax problems
From MaRDI portal
Recommendations
- Corrected sequential linear programming for sparse minimax optimization
- A smoothing trust-region Newton-CG method for minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- scientific article; zbMATH DE number 1932369
- Primal interior-point method for large sparse minimax optimization
Cites work
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A model algorithm for composite nondifferentiable optimization problems
- A smooth method for the finite minimax problem
- An Algorithm for Minimax Approximation in the Nonlinear Case
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- An Efficient Method to Solve the Minimax Problem Directly
- Combined lp and quasi-Newton methods for minimax optimization
- Corrected sequential linear programming for sparse minimax optimization
- Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(4)
This page was built for publication: A projected conjugate gradient method for sparse minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315210)
