An aggregate subgradient method for nonsmooth convex minimization (Q3039046): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q97724635, #quickstatements; #temporary_batch_1707303357582
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization / 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: Q4739675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199833 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02591907 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039110678 / rank
 
Normal rank

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
An aggregate subgradient method for nonsmooth convex minimization
scientific article

    Statements

    An aggregate subgradient method for nonsmooth convex minimization (English)
    0 references
    1983
    0 references
    nonsmooth optimization
    0 references
    descent methods
    0 references
    convex nondifferentiable objective function
    0 references
    unconstrained minimisation
    0 references
    subgradient
    0 references
    global convergence
    0 references

    Identifiers

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