Pages that link to "Item:Q607498"
From MaRDI portal
The following pages link to Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498):
Displaying 50 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Optimized first-order methods for smooth convex minimization (Q312663) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- Proximal methods for the latent group lasso penalty (Q457209) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem (Q902100) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← 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)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← 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)
- Level-set methods for convex optimization (Q1739042) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization (Q1983931) (← links)
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
- A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- An inexact accelerated stochastic ADMM for separable convex optimization (Q2114819) (← links)
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- Augmented Lagrangian methods for convex matrix optimization problems (Q2158112) (← links)
- On convex envelopes and regularization of non-convex functionals without moving global minima (Q2275270) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- When only global optimization matters (Q2392106) (← links)
- Convex optimization approach to signals with fast varying instantaneous frequency (Q2409037) (← links)
- A unified penalized method for sparse additive quantile models: an RKHS approach (Q2409400) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- Proximal gradient methods for multiobjective optimization and their applications (Q2419509) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
