Pages that link to "Item:Q359630"
From MaRDI portal
The following pages link to Gradient methods for minimizing composite functions (Q359630):
Displaying 50 items.
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach (Q259109) (← links)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- Optimized first-order methods for smooth convex minimization (Q312663) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- Universal gradient methods for convex optimization problems (Q494332) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
- On the convergence analysis of the optimized gradient method (Q511969) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- A projection method on measures sets (Q515908) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
- Consistent learning by composite proximal thresholding (Q681492) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization (Q827573) (← links)
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions (Q829737) (← links)
- Accelerated proximal algorithms with a correction term for monotone inclusions (Q832632) (← links)
- An inertial forward-backward algorithm for monotone inclusions (Q890044) (← links)
- iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- Nonnegative data interpolation by spherical splines (Q1639564) (← links)
- Accelerating \(\ell^1\)-\(\ell^2\) deblurring using wavelet expansions of operators (Q1643857) (← links)
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation (Q1668721) (← links)
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms (Q1669617) (← links)
- Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Inexact proximal stochastic gradient method for convex composite optimization (Q1694394) (← links)
- Hierarchical sparse modeling: a choice of two group Lasso formulations (Q1704702) (← links)
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming (Q1716951) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- Conditional gradient type methods for composite nonlinear and stochastic optimization (Q1717236) (← links)
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
- On variance reduction for stochastic smooth convex optimization with multiplicative noise (Q1739038) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
