Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An accelerated coordinate gradient descent algorithm for non-separable composite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes / 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: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact block coordinate descent methods with application to non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Gradient Methods with Adaptive Subspace Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Bregman Majorization Minimization with Extrapolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity analysis of randomized block-coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Coordinate Descent Methods for Nonseparable Composite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized sketch descent methods for non-separable linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the cubic regularization of Newton's method on convex problems / 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: Inexact basic tensor methods for some classes of convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search directions for minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679021 / 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: Coordinate descent algorithms / rank
 
Normal rank

Revision as of 16:43, 2 August 2024

scientific article; zbMATH DE number 7731070
Language Label Description Also known as
English
Random Coordinate Descent Methods for Nonseparable Composite Optimization
scientific article; zbMATH DE number 7731070

    Statements

    Random Coordinate Descent Methods for Nonseparable Composite Optimization (English)
    0 references
    0 references
    0 references
    23 August 2023
    0 references
    composite minimization
    0 references
    nonseparable objective function
    0 references
    random coordinate descent
    0 references
    adaptive stepsize
    0 references
    convergence rates
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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