Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization

DOI10.1007/s10898-014-0151-9zbMath1335.90074arXiv1305.4027OpenAlexW2049556680MaRDI QIDQ486721

Ion Necoara, Andrei T. Patrascu

Publication date: 16 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4027

zbMATH Keywords

convergence analysisasymptotic convergenceconvergence rate in expectationlarge-scale nonconvex optimizationrandom coordinate descent algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (20)

Selective bi-coordinate variations for resource allocation type problems ⋮ An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ Random block coordinate descent methods for linearly constrained optimization over networks ⋮ Scalable subspace methods for derivative-free nonlinear least-squares optimization ⋮ Accelerating block coordinate descent methods with identification strategies ⋮ An almost cyclic 2-coordinate descent method for singly linearly constrained problems ⋮ Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization ⋮ A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming ⋮ Partial correlation graphical LASSO ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ On the complexity analysis of randomized block-coordinate descent methods ⋮ Inexact variable metric stochastic block-coordinate descent for regularized optimization ⋮ Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ On solving the densestk-subgraph problem on large graphs ⋮ A generic coordinate descent solver for non-smooth convex optimisation ⋮ Coordinate descent algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel coordinate descent methods for big data optimization
• Gradient methods for minimizing composite functions
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Effective reformulations of the truss topology design problem
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• A coordinate gradient descent method for nonsmooth separable minimization
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Introductory lectures on convex optimization. A basic course.
• Computing eigenelements of real symmetric matrices via optimization
• Random block coordinate descent methods for linearly constrained optimization over networks
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• A Maximum Principle for the Stability Analysis of Positive Bilinear Control Systems with Applications to Positive Linear Switched Systems
• Projected gradient methods for linearly constrained problems
• Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design
• Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
• Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
• On search directions for minimization algorithms

This page was built for publication: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization