The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors (Q3590034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4454225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert-Valued Perturbed Subgradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full convergence of the steepest descent method with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error stability properties of generalized gradient-type algorithms / rank
 
Normal rank

Latest revision as of 06:05, 3 July 2024

scientific article
Language Label Description Also known as
English
The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
scientific article

    Statements

    The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors (English)
    0 references
    17 September 2010
    0 references
    constrained optimization
    0 references
    convex function
    0 references
    Hilbert space
    0 references
    projected subgradient method
    0 references

    Identifiers