A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2275286187 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.6526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized proximal point algorithm for certain non-convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal method for stochastic composite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-monotone subgradient methods for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:11, 12 July 2024

scientific article
Language Label Description Also known as
English
A family of subgradient-based methods for convex optimization problems in a unifying framework
scientific article

    Statements

    A family of subgradient-based methods for convex optimization problems in a unifying framework (English)
    0 references
    0 references
    0 references
    8 November 2016
    0 references
    non-smooth/smooth convex optimization
    0 references
    structured convex optimization
    0 references
    subgradient/gradient-based proximal method
    0 references
    mirror-descent method
    0 references
    dual-averaging method
    0 references
    complexity bounds
    0 references

    Identifiers

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