Pages that link to "Item:Q644913"

The following pages link to Incremental proximal methods for large scale convex optimization (Q644913):

Displaying 50 items.

• Incremental subgradient methods for nondifferentiable optimization (Q2784405) (← links)
• A second order nonsmooth variational model for restoring manifold-valued images (Q2790077) (← links)
• Stochastic first-order methods with random constraint projection (Q2796796) (← links)
• Ergodic convergence of a stochastic proximal point algorithm (Q2828340) (← links)
• Hybrid deterministic-stochastic methods for data fitting (Q2909270) (← links)
• Non-smooth Variational Regularization for Processing Manifold-Valued Data (Q3300533) (← links)
• Manifold-Valued Data in Medical Imaging Applications (Q3300558) (← links)
• Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
• An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming (Q4620422) (← links)
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
• Relative Optimality Conditions and Algorithms for Treespace Fréchet Means (Q4637500) (← links)
• Subgradient algorithms on Riemannian manifolds of lower bounded curvatures (Q4639125) (← links)
• Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
• Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666) (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
• The Averaged Kaczmarz Iteration for Solving Inverse Problems (Q4686928) (← links)
• Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications (Q4687241) (← links)
• Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions (Q4687243) (← links)
• Total Generalized Variation for Manifold-Valued Data (Q4689778) (← links)
• (Q4967840) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
• Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems (Q4999758) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
• Sparse reduced-rank regression for multivariate varying-coefficient models (Q5065249) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• Sublinear Convergence of a Tamed Stochastic Gradient Descent Method in Hilbert Space (Q5093647) (← links)
• (Q5095426) (← links)
• Wavelet Sparse Regularization for Manifold-Valued Data (Q5112041) (← links)
• A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
• DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338) (← links)
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (Q5219716) (← links)
• Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
• Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm (Q5252921) (← links)
• Estimation of a sparse and spiked covariance matrix (Q5256289) (← links)
• Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
• Subsampled inexact Newton methods for minimizing large sums of convex functions (Q5857347) (← links)
• Splitting proximal with penalization schemes for additive convex hierarchical minimization problems (Q5858997) (← links)
• An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising (Q5860376) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• Two proximal splitting methods in Hadamard spaces (Q6042685) (← links)
• Old and new challenges in Hadamard spaces (Q6052560) (← links)
• Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks (Q6085458) (← links)
• Sparse and Low-Rank Matrix Quantile Estimation With Application to Quadratic Regression (Q6086172) (← links)
• Circuit analysis using monotone+skew splitting (Q6092464) (← links)
• An asynchronous subgradient-proximal method for solving additive convex optimization problems (Q6093360) (← links)
• Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
• First-order methods for convex optimization (Q6169988) (← links)