Pages that link to "Item:Q359630"

The following pages link to Gradient methods for minimizing composite functions (Q359630):

Displaying 50 items.

• Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
• A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
• Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization (Q2129627) (← links)
• A high-dimensional M-estimator framework for bi-level variable selection (Q2135521) (← links)
• GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875) (← links)
• An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
• Oracle complexity separation in convex optimization (Q2139268) (← links)
• Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics (Q2139279) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• Accelerated inexact composite gradient methods for nonconvex spectral optimization problems (Q2149955) (← links)
• Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems (Q2159429) (← links)
• Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
• Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization (Q2162532) (← links)
• Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems (Q2163465) (← links)
• A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
• Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor (Q2173337) (← links)
• Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem (Q2176283) (← links)
• Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
• An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• Accelerated and unaccelerated stochastic gradient descent in model generality (Q2210408) (← links)
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
• Decomposition in derivative-free optimization (Q2231319) (← links)
• Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping (Q2232743) (← links)
• Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
• On the linear convergence rates of exchange and continuous methods for total variation minimization (Q2235147) (← links)
• Approximating the total variation with finite differences or finite elements (Q2235783) (← links)
• Accelerated gradient sliding for minimizing a sum of functions (Q2243755) (← links)
• Automatic repair of convex optimization problems (Q2245690) (← links)
• Sparse trace norm regularization (Q2259743) (← links)
• Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q2260661) (← links)
• Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
• Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
• Sorted concave penalized regression (Q2284364) (← links)
• Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
• A large covariance matrix estimator under intermediate spikiness regimes (Q2293542) (← links)
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241) (← links)
• Universal method of searching for equilibria and stochastic equilibria in transportation networks (Q2314190) (← links)
• Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
• Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints (Q2315079) (← links)