Pages that link to "Item:Q2910875"

The following pages link to Efficiency of coordinate descent methods on huge-scale optimization problems (Q2910875):

Displaying 33 items.

• Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)
• Conjugate gradients acceleration of coordinate descent for linear systems (Q6134425) (← links)
• The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
• Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• Convergence of gradient algorithms for nonconvex \(C^{1+ \alpha}\) cost functions (Q6167107) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Robust supervised learning with coordinate gradient descent (Q6172182) (← links)
• Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• A bicomposition of conical projections (Q6194916) (← links)
• Adaptive Catalyst for Smooth Convex Optimization (Q6329866) (← links)
• Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
• Distributed optimal consensus of multi-agent systems: a randomized parallel approach (Q6537292) (← links)
• Community detection with nodal information: likelihood and its variational approximation (Q6543838) (← links)
• A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty (Q6559997) (← links)
• Online convex optimization using coordinate descent algorithms (Q6566762) (← links)
• Randomized methods for computing optimal transport without regularization and their convergence analysis (Q6571381) (← links)
• Via order markets towards price-taking equilibrium (Q6582420) (← links)
• Convergence rate of gradient-concordant methods for smooth unconstrained optimization (Q6588729) (← links)
• Statistical computational learning (Q6602226) (← links)
• Global stability of first-order methods for coercive tame functions (Q6608042) (← links)
• Acceleration and restart for the randomized Bregman-Kaczmarz method (Q6615435) (← links)
• Backward error analysis and the qualitative behaviour of stochastic optimization algorithms: application to stochastic coordinate descent (Q6616289) (← links)
• A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks (Q6624433) (← links)
• PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
• On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)
• The ``black-box'' optimization problem: zero-order accelerated stochastic method via kernel approximation (Q6655796) (← links)
• Convergence rate of random scan coordinate ascent variational inference under log-concavity (Q6658291) (← links)
• Hybrid greedy randomized coordinate descent method for solving large-scale linear least square problem (Q6665199) (← links)
• Several kinds of acceleration techniques for unconstrained optimization first-order algorithms (Q6665360) (← links)