A projected conjugate gradient method for sparse minimax problems

DOI10.1007/BF02108465zbMath0789.65047MaRDI QIDQ1315210

Kristján Jónasson

Publication date: 24 February 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

numerical results; conjugate gradients; trust region methods; sequential linear programming; nonlinear minimax problems; first order method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Approximation in normed linear spaces

Uses Software

• LANCELOT
• MMLA1Q

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• Corrected sequential linear programming for sparse minimax optimization
• Nonlinear programming and nonsmooth optimization by successive linear programming
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A model algorithm for composite nondifferentiable optimization problems
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• An Efficient Method to Solve the Minimax Problem Directly
• The Minimax Solution of an Overdetermined System of Non-linear Equations
• An Algorithm for Minimax Approximation in the Nonlinear Case