On the convergence rate of scaled gradient projection method
From MaRDI portal
Publication:4559401
DOI10.1080/02331934.2018.1455833zbMath1414.90333OpenAlexW2795276419MaRDI QIDQ4559401
Kai Wang, Hongjin He, Xi-Hong Yan
Publication date: 3 December 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1455833
constrained optimizationconvergence ratefirst-order methodnonmonotone line searchgradient projection method
Related Items (max. 100)
On the inexact scaled gradient projection method ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- First-order methods of smooth convex optimization with inexact oracle
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- An improved gradient projection-based decomposition technique for support vector machines
- Minimization of functions having Lipschitz continuous first partial derivatives
- Smoothing and First Order Methods: A Unified Framework
- New convergence results for the scaled gradient projection method
- On the rate of convergence of projected Barzilai–Borwein methods
- A scaled gradient projection method for constrained image deblurring
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Gradient projection methods for quadratic programs and applications in training support vector machines
- On first-order algorithms forl1/nuclear norm minimization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- Adaptive two-point stepsize gradient algorithm
- On the nonmonotone line search
This page was built for publication: On the convergence rate of scaled gradient projection method
