Analysis of monotone gradient methods
From MaRDI portal
Publication:1780127
DOI10.3934/JIMO.2005.1.181zbMATH Open1071.65084OpenAlexW2326893138MaRDI QIDQ1780127FDOQ1780127
Authors: Yuhong Dai, Yaxiang Yuan 
Publication date: 7 June 2005
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2005.1.181
Recommendations
- scientific article; zbMATH DE number 880230
- Monotonic Analysis Over Nonconvex Cones
- Convergence of approximations of monotone gradient systems
- Convergence analysis of an iterative algorithm for monotone operators
- scientific article; zbMATH DE number 6936843
- scientific article; zbMATH DE number 24440
- On the monotone convergence of general Newton-like methods
- Variational and monotonicity methods in nonsmooth analysis
- scientific article; zbMATH DE number 1329065
- A monotonicity result for norms in conjugate gradient algorithms
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Cited In (37)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- A stochastic variance reduced gradient method with adaptive step for stochastic optimization
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- On the application of the spectral projected gradient method in image segmentation
- The convergence of conjugate gradient method with nonmonotone line search
- Global convergence of conjugate gradient method
- An efficient gradient method using the Yuan steplength
- On the asymptotic convergence and acceleration of gradient methods
- On \(R\)-linear convergence analysis for a class of gradient methods
- Training GANs with centripetal acceleration
- A limited memory steepest descent method
- Projected gradient algorithms for optimization over order simplices
- Cyclic gradient methods for unconstrained optimization
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- New stepsizes for the gradient method
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- Convergence of memory gradient methods
- New gradient methods with adaptive stepsizes by approximate models
- Alternate step gradient method*
- Adjoint-free calculation method for conditional nonlinear optimal perturbations
- On the steplength selection in gradient methods for unconstrained optimization
- On the acceleration of the Barzilai-Borwein method
- Accelerated gradient descent methods with line search
- An overview of nonlinear optimization
- Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method
- Delayed gradient methods for symmetric and positive definite linear systems
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Gradient method with multiple damping for large-scale unconstrained optimization
- A family of spectral gradient methods for optimization
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- A gradient method exploiting the two dimensional quadratic termination property
- Several kinds of acceleration techniques for unconstrained optimization first-order algorithms
- A survey of gradient methods for solving nonlinear optimization
- The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- Gradient methods exploiting spectral properties
This page was built for publication: Analysis of monotone gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780127)
