Pages that link to "Item:Q486721"
From MaRDI portal
The following pages link to Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721):
Displaying 31 items.
- Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem (Q2010729) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems (Q2848180) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution (Q6071888) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Partial correlation graphical LASSO (Q6196791) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
- A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem (Q6569058) (← links)
- On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)
- Estimation of time-dependent transmission rate for COVID-19 SVIRD model using predictor-corrector algorithm (Q6651993) (← links)
