Pages that link to "Item:Q2910875"
From MaRDI portal
The following pages link to Efficiency of coordinate descent methods on huge-scale optimization problems (Q2910875):
Displaying 50 items.
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization (Q5144794) (← links)
- A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints (Q5152476) (← links)
- (Q5155916) (← links)
- (Q5158544) (← links)
- (Q5159402) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Stochastic sub-sampled Newton method with variance reduction (Q5204645) (← links)
- CoordinateWise Descent Methods for Leading Eigenvalue Problem (Q5230665) (← links)
- An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
- Stochastic subspace correction methods and fault tolerance (Q5235100) (← links)
- Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme (Q5236622) (← links)
- An alternating minimization method for robust principal component analysis (Q5238069) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
- Importance sampling in signal processing applications (Q5358731) (← links)
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression (Q5372641) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping (Q5501199) (← links)
- Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization (Q5501228) (← links)
- Direct Search Based on Probabilistic Descent (Q5502242) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- An acceleration procedure for optimal first-order methods (Q5746718) (← links)
- On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems (Q5853570) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← 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)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems (Q5885824) (← links)
- Block coordinate type methods for optimization and learning (Q5889894) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- Worst case complexity of direct search under convexity (Q5962720) (← links)
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm (Q5962728) (← links)
- A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent (Q6039155) (← links)
- Block-cyclic stochastic coordinate descent for deep neural networks (Q6054553) (← links)
- Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization (Q6086133) (← links)
- Parameter estimation in a 3‐parameter <i>p</i>‐star random graph model (Q6087121) (← links)
- Cluster‐based gradient method for stochastic optimal control problems with elliptic partial differential equation constraint (Q6090380) (← links)
- Adaptive coordinate sampling for stochastic primal–dual optimization (Q6092496) (← links)
- Block Policy Mirror Descent (Q6093281) (← links)
- Derivation of coordinate descent algorithms from optimal control theory (Q6097432) (← links)
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces (Q6101039) (← links)
