Pages that link to "Item:Q2945126"

The following pages link to Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126):

Displaying 30 items.

• A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods (Q2031928) (← links)
• On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems (Q2112682) (← links)
• On Hermite-Hadamard type inequalities for \(n \)-polynomial convex stochastic processes (Q2133355) (← links)
• Inertial stochastic PALM and applications in machine learning (Q2143164) (← links)
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
• Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
• Markov chain block coordinate descent (Q2301127) (← links)
• Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
• On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
• Randomized Kaczmarz with averaging (Q2660609) (← links)
• Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization (Q2679567) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
• (Q4969198) (← links)
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization (Q5024392) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games (Q5108262) (← links)
• Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization (Q5144794) (← links)
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)
• Sparse low-rank separated representation models for learning from data (Q5243616) (← links)
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401) (← links)
• Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• New stochastic fractional integral and related inequalities of Jensen-Mercer and Hermite-Hadamard-Mercer type for convex stochastic processes (Q6067228) (← links)
• Block Policy Mirror Descent (Q6093281) (← links)
• Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks (Q6540474) (← links)
• A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems (Q6590593) (← links)