Pages that link to "Item:Q1312756"

The following pages link to Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756):

Displaying 50 items.

• On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
• A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints (Q626646) (← links)
• A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications (Q715072) (← links)
• Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods (Q730193) (← links)
• Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
• New trends in general variational inequalities (Q829617) (← links)
• Nonparallel hyperplane support vector machine for binary classification problems (Q903637) (← 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)
• Error bounds in mathematical programming (Q1365060) (← links)
• Convergence analysis of perturbed feasible descent methods (Q1379956) (← links)
• New error bounds and their applications to convergence analysis of iterative algorithms (Q1584006) (← links)
• An inexact Newton-like conditional gradient method for constrained nonlinear systems (Q1651415) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
• Extragradient method in optimization: convergence and complexity (Q1706412) (← links)
• On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← 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)
• On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions (Q1753075) (← links)
• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
• Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
• Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
• Some developments in general variational inequalities (Q1880886) (← links)
• On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
• A coordinate descent margin based-twin support vector machine for classification (Q1943043) (← links)
• Separable spherical constraints and the decrease of a quadratic function in the gradient projection step (Q1955575) (← links)
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems (Q1983743) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches (Q2022225) (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
• On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
• Distributed optimization for degenerate loss functions arising from over-parameterization (Q2060697) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
• Network manipulation algorithm based on inexact alternating minimization (Q2109010) (← links)
• Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
• A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
• On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)