Gradient methods with regularization for constrained optimization problems and their complexity estimates (Q4643688): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3346839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4069345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems / rank
 
Normal rank

Latest revision as of 17:02, 15 July 2024

scientific article; zbMATH DE number 6875468
Language Label Description Also known as
English
Gradient methods with regularization for constrained optimization problems and their complexity estimates
scientific article; zbMATH DE number 6875468

    Statements

    Gradient methods with regularization for constrained optimization problems and their complexity estimates (English)
    0 references
    0 references
    28 May 2018
    0 references
    convex optimization
    0 references
    Hilbert space
    0 references
    gradient projection method
    0 references
    conditional gradient method
    0 references
    strong convergence
    0 references
    complexity estimates
    0 references

    Identifiers