A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 8 users not shown)
Property / author
 
Property / author: Andrei T. Patrascu / rank
Normal rank
 
Property / author
 
Property / author: Andrei T. Patrascu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6353815 / rank
 
Normal rank
Property / zbMATH Keywords
 
coordinate descent
Property / zbMATH Keywords: coordinate descent / rank
 
Normal rank
Property / zbMATH Keywords
 
composite objective function
Property / zbMATH Keywords: composite objective function / rank
 
Normal rank
Property / zbMATH Keywords
 
linearly coupled constraints
Property / zbMATH Keywords: linearly coupled constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized algorithms
Property / zbMATH Keywords: randomized algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence rate
Property / zbMATH Keywords: convergence rate / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\mathcal{O}(1/\epsilon)\)
Property / zbMATH Keywords: \(\mathcal{O}(1/\epsilon)\) / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999593606 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1302.3074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Block Coordinate Descent Type Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for Massive Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-time algorithms for the continuous quadratic Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random block coordinate descent methods for linearly constrained optimization over networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient block-coordinate descent algorithms for the group Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate level method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coordinate descent methods for big data optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact coordinate descent: complexity and preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scaling of a gradient method for distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methodologies for the smallest enclosing circle problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:12, 9 July 2024

scientific article
Language Label Description Also known as
English
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
scientific article

    Statements

    A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (English)
    0 references
    0 references
    0 references
    10 October 2014
    0 references
    coordinate descent
    0 references
    composite objective function
    0 references
    linearly coupled constraints
    0 references
    randomized algorithms
    0 references
    convergence rate
    0 references
    \(\mathcal{O}(1/\epsilon)\)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers