On convergence of a q-random coordinate constrained algorithm for non-convex problems
From MaRDI portal
(Redirected from Publication:6635808)
On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems
On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems
Recommendations
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
Cites work
- A block coordinate descent method for sensor network localization
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- Convex optimization for the densest subgraph and densest submatrix problems
- Coordinate descent algorithms
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Edge-Preserving Image Denoising via Group Coordinate Descent on the GPU
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- Fast projection onto the simplex and the l₁ ball
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Lectures on convex optimization
- On solving the densest \(k\)-subgraph problem on large graphs
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Probability with Martingales
- Projected gradient methods for linearly constrained problems
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- Subgradient methods for huge-scale optimization problems
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
This page was built for publication: On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635808)
