New adaptive stepsize selections in gradient methods
From MaRDI portal
Publication:1008801
DOI10.3934/jimo.2008.4.299zbMath1161.90524MaRDI QIDQ1008801
Giacomo Frassoldati, Luca Zanni, Gaetano Zanghirati
Publication date: 30 March 2009
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2008.4.299
unconstrained optimization; gradient methods; adaptive stepsize selections; strictly convex quadratics
65K05: Numerical mathematical programming methods
65K10: Numerical optimization and variational techniques
90C20: Quadratic programming
90C52: Methods of reduced gradient type
Related Items
Shearlet-based regularized reconstruction in region-of-interest computed tomography, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, On projected alternating BB methods for variational inequalities, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Gradient methods exploiting spectral properties, A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems, 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, Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, An efficient gradient method using the Yuan steplength, Geometrical inverse matrix approximation for least-squares problems and acceleration strategies, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Numerical methods for parameter estimation in Poisson data inversion, A new steplength selection for scaled gradient methods with application to image deblurring, A convergent least-squares regularized blind deconvolution approach, Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm, A cyclic projected gradient method, Iterative regularization algorithms for constrained image deblurring on graphics processors, Steplength selection in gradient projection methods for box-constrained quadratic programs, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, Variable metric techniques for forward-backward methods in imaging, New stepsizes for the gradient method, A delayed weighted gradient method for strictly convex quadratic minimization, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, A family of spectral gradient methods for optimization, Runge-Kutta-like scaling techniques for first-order methods in convex optimization, A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography, On the steplength selection in gradient methods for unconstrained optimization, Inexact Bregman iteration for deconvolution of superimposed extended and point sources, Scaling Techniques for $\epsilon$-Subgradient Methods, Scaling techniques for gradient projection-type methods in astronomical image deblurring, Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy, On the rate of convergence of projected Barzilai–Borwein methods
