Alternate minimization gradient method
From MaRDI portal
Publication:4457843
DOI10.1093/imanum/23.3.377zbMath1055.65073OpenAlexW2039771911MaRDI QIDQ4457843
Publication date: 17 March 2004
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/23.3.377
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems ⋮ Gradient methods with adaptive step-sizes ⋮ Ritz-like values in steplength selections for stochastic gradient methods ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Some Goldstein's type methods for co-coercive variant variational inequalities ⋮ An iterative method for solving a bi-objective constrained portfolio optimization problem ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ A new steplength selection for scaled gradient methods with application to image deblurring ⋮ A comparison of edge-preserving approaches for differential interference contrast microscopy ⋮ Fast gradient methods with alignment for symmetric linear systems without using Cauchy step ⋮ Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods ⋮ Non-monotone projection gradient method for non-negative matrix factorization ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ The chaotic nature of faster gradient descent methods ⋮ Real-time adaptive optics with pyramid wavefront sensors: part II. Accurate wavefront reconstruction using iterative methods ⋮ Gradient methods exploiting spectral properties ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A new gradient method via least change secant update ⋮ An efficient gradient method using the Yuan steplength ⋮ Prediction-correction method with BB step sizes ⋮ Accelerated diagonal gradient-type method for large-scale unconstrained optimization ⋮ An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem ⋮ A second-order gradient method for convex minimization ⋮ An Alternating Direction Method of Multipliers for Optimal Control Problems Constrained with Elliptic Equations ⋮ An effective first order reliability method based on Barzilai-Borwein step ⋮ A new modified Barzilai-Borwein gradient method for the quadratic minimization problem ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems ⋮ A new gradient method with an optimal stepsize property ⋮ A delayed weighted gradient method for strictly convex quadratic minimization ⋮ Accelerated gradient descent methods with line search ⋮ A globally optimal tri-vector method to solve an ill-posed linear system ⋮ On the asymptotic convergence and acceleration of gradient methods ⋮ A new gradient method via quasi-Cauchy relation which guarantees descent ⋮ A family of spectral gradient methods for optimization ⋮ A descent algorithm without line search for unconstrained optimization ⋮ Accelerated multiple step-size methods for solving unconstrained optimization problems ⋮ An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems ⋮ On the acceleration of the Barzilai-Borwein method
This page was built for publication: Alternate minimization gradient method
