Alternate minimization gradient method
From MaRDI portal
Publication:4457843
Recommendations
Cited in
(45)- Alternate step gradient method*
- An improved multi-step gradient-type method for large scale optimization
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- Prediction-correction method with BB step sizes
- A new two-step gradient-type method for large-scale unconstrained optimization
- New gradient methods with adaptive stepsizes by approximate models
- A family of spectral gradient methods for optimization
- On the asymptotic convergence and acceleration of gradient methods
- A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems
- A descent algorithm without line search for unconstrained optimization
- Delayed gradient methods for symmetric and positive definite linear systems
- Non-monotone projection gradient method for non-negative matrix factorization
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- An alternating direction method of multipliers for optimal control problems constrained with elliptic equations
- Cyclic gradient methods for unconstrained optimization
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- On the acceleration of the Barzilai-Borwein method
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
- An effective first order reliability method based on Barzilai-Borwein step
- An iterative method for solving a bi-objective constrained portfolio optimization problem
- Accelerated gradient descent methods with line search
- Some Goldstein's type methods for co-coercive variant variational inequalities
- The chaotic nature of faster gradient descent methods
- A new gradient method via least change secant update
- A second-order gradient method for convex minimization
- A new steplength selection for scaled gradient methods with application to image deblurring
- A delayed weighted gradient method for strictly convex quadratic minimization
- A globally optimal tri-vector method to solve an ill-posed linear system
- A new gradient method with an optimal stepsize property
- A gradient method exploiting the two dimensional quadratic termination property
- Accelerated diagonal gradient-type method for large-scale unconstrained optimization
- An efficient gradient method using the Yuan steplength
- Real-time adaptive optics with pyramid wavefront sensors. II: Accurate wavefront reconstruction using iterative methods
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
- On the steplength selection in gradient methods for unconstrained optimization
- Gradient methods exploiting spectral properties
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- Ritz-like values in steplength selections for stochastic gradient methods
- Gradient methods with adaptive step-sizes
- A new spectral method for \(l_1\)-regularized minimization
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- A new gradient method via quasi-Cauchy relation which guarantees descent
- A survey of gradient methods for solving nonlinear optimization
This page was built for publication: Alternate minimization gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457843)
