Pages that link to "Item:Q3988952"

The following pages link to On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization (Q3988952):

Displaying 50 items.

• On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
• On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
• Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
• On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
• The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth (Q523179) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications (Q715072) (← links)
• Sufficient conditions for error bounds of difference functions and applications (Q727390) (← links)
• A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
• Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems (Q1290664) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
• Error bounds for analytic systems and their applications (Q1340064) (← links)
• Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
• A class of iterative methods for solving nonlinear projection equations (Q1359468) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• On globally Q-linear convergence of a splitting method for group Lasso (Q1656198) (← links)
• A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
• A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
• Separable spherical constraints and the decrease of a quadratic function in the gradient projection step (Q1955575) (← links)
• A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem (Q2054671) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
• An infeasible projection type algorithm for nonmonotone variational inequalities (Q2118960) (← links)
• Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
• A proximal gradient descent method for the extended second-order cone linear complementarity problem (Q2268076) (← links)
• Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
• Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
• A new error bound for linear complementarity problems with weakly chained diagonally dominant \(B\)-matrices (Q2284817) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem (Q2316190) (← links)
• Convergence rates of forward-Douglas-Rachford splitting method (Q2317846) (← links)
• On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
• Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)