Planar quasi-Newton algorithms for unconstrained saddlepoint problems (Q1054999): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hyperbolic Pairs in the Method of Conjugate Gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaling Variable Metric (SSVM) Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convergence of a Class of Double-rank Minimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Residual Method for Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Sparse Indefinite Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Methods with Inexact Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming / rank
 
Normal rank

Revision as of 09:23, 14 June 2024

scientific article
Language Label Description Also known as
English
Planar quasi-Newton algorithms for unconstrained saddlepoint problems
scientific article

    Statements

    Planar quasi-Newton algorithms for unconstrained saddlepoint problems (English)
    0 references
    0 references
    1984
    0 references
    planar iteration
    0 references
    quasi-Newton methods
    0 references
    conjugate-directions algorithms
    0 references
    indefinite quadratic forms
    0 references
    saddlepoint problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references