Pages that link to "Item:Q4687241"

The following pages link to Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications (Q4687241):

Displayed 37 items.

• Stochastic primal dual fixed point method for composite optimization (Q777039) ‎ (← links)
• Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI (Q826182) ‎ (← links)
• The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) ‎ (← links)
• Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) ‎ (← links)
• A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) ‎ (← links)
• Variable smoothing for weakly convex composite functions (Q2031930) ‎ (← links)
• Analysis of stochastic gradient descent in continuous time (Q2058762) ‎ (← links)
• An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) ‎ (← links)
• High-performance statistical computing in the computing environments of the 2020s (Q2092893) ‎ (← links)
• An inexact accelerated stochastic ADMM for separable convex optimization (Q2114819) ‎ (← links)
• A hybrid stochastic optimization framework for composite nonconvex optimization (Q2118109) ‎ (← links)
• Deep learning for inverse problems. Abstracts from the workshop held March 7--13, 2021 (hybrid meeting) (Q2131206) ‎ (← links)
• Inertial stochastic PALM and applications in machine learning (Q2143164) ‎ (← links)
• Inexact first-order primal-dual algorithms (Q2181598) ‎ (← links)
• Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) ‎ (← links)
• Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) ‎ (← links)
• Primal-dual incremental gradient method for nonsmooth and convex optimization problems (Q2230784) ‎ (← links)
• A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems (Q2234476) ‎ (← links)
• Unified linear convergence of first-order primal-dual algorithms for saddle point problems (Q2673526) ‎ (← links)
• An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function (Q2701426) ‎ (← links)
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) ‎ (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) ‎ (← links)
• (Q4969178) ‎ (← links)
• Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) ‎ (← links)
• (Q4999081) ‎ (← links)
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization (Q5024392) ‎ (← links)
• (Q5054622) ‎ (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) ‎ (← links)
• Golden Ratio Primal-Dual Algorithm with Linesearch (Q5093645) ‎ (← links)
• Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) ‎ (← links)
• Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) ‎ (← links)
• A Stochastic Variance Reduced Primal Dual Fixed Point Method for Linearly Constrained Separable Optimization (Q5860367) ‎ (← links)
• A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) ‎ (← links)
• A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates (Q5882231) ‎ (← links)
• Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) ‎ (← links)
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) ‎ (← links)
• Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) ‎ (← links)