Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-004-0553-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-004-0553-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006118023 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57392923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / 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: Complexity estimates of some cutting plane methods based on the analytic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-004-0553-4 / rank
 
Normal rank

Latest revision as of 10:28, 11 December 2024

scientific article
Language Label Description Also known as
English
Non-Euclidean restricted memory level method for large-scale convex optimization
scientific article

    Statements

    Non-Euclidean restricted memory level method for large-scale convex optimization (English)
    0 references
    0 references
    0 references
    29 April 2005
    0 references
    subgradient-type method
    0 references
    large-scale nonsmooth convex functions over simple domains
    0 references
    non-Lipschitzian convex objectives
    0 references
    saddle point
    0 references
    variational inequalities
    0 references

    Identifiers