A descent algorithm for nonsmooth convex optimization (Q3337229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle type approach to the unconstrained minimization of convex nonsmooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank

Revision as of 13:46, 14 June 2024

scientific article
Language Label Description Also known as
English
A descent algorithm for nonsmooth convex optimization
scientific article

    Statements

    A descent algorithm for nonsmooth convex optimization (English)
    0 references
    0 references
    1984
    0 references
    nonsmooth convex optimization
    0 references
    cutting planes
    0 references
    epsilon-subgradient algorithm
    0 references
    descent algorithm
    0 references
    convergence theorem
    0 references
    computational experience
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references