A projected conjugate gradient method for sparse minimax problems (Q1315210): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LANCELOT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MMLA1Q / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method to Solve the Minimax Problem Directly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model algorithm for composite nondifferentiable optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming and nonsmooth optimization by successive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined lp and quasi-Newton methods for minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric methods for minimizing a class of nondifferentiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrected sequential linear programming for sparse minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Minimax Approximation in the Nonlinear Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smooth method for the finite minimax problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimax Solution of an Overdetermined System of Non-linear Equations / rank
 
Normal rank

Latest revision as of 12:15, 22 May 2024

scientific article
Language Label Description Also known as
English
A projected conjugate gradient method for sparse minimax problems
scientific article

    Statements

    A projected conjugate gradient method for sparse minimax problems (English)
    0 references
    24 February 1994
    0 references
    The author presents a trust region type first order method based on sequential linear programming for solving nonlinear minimax problems. Numerical results show that this method has considerable improvement over other first order methods.
    0 references
    nonlinear minimax problems
    0 references
    conjugate gradients
    0 references
    trust region methods
    0 references
    numerical results
    0 references
    first order method
    0 references
    sequential linear programming
    0 references
    0 references
    0 references

    Identifiers