A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056)

From MaRDI portal
Revision as of 14:11, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A descent method with linear programming subproblems for nondifferentiable convex optimization
scientific article

    Statements

    A descent method with linear programming subproblems for nondifferentiable convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    13 October 1996
    0 references
    proximal-type descent methods
    0 references
    direction-finding subproblem
    0 references
    nondifferentiable convex optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references