The Extragradient Method for Convex Optimization in the Presence of Computational Errors (Q4899104): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/01630563.2012.706769 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000091955 / 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
Property / cites work
 
Property / cites work: The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors / rank
 
Normal rank

Latest revision as of 02:15, 6 July 2024

scientific article; zbMATH DE number 6122157
Language Label Description Also known as
English
The Extragradient Method for Convex Optimization in the Presence of Computational Errors
scientific article; zbMATH DE number 6122157

    Statements

    Identifiers

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