The cyclic Barzilai-–Borwein method for unconstrained optimization
From MaRDI portal
Publication:5480392
DOI10.1093/imanum/drl006zbMath1147.65315OpenAlexW2144331407MaRDI QIDQ5480392
William W. Hager, Klaus Schittkowski, Hongchao Zhang, Yu-Hong Dai
Publication date: 1 August 2006
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drl006
algorithmunconstrained optimizationconvergencenumerical experimentsconjugate gradient algorithmconvex quadratic programminggradient methodnon-monotone line searchcyclic Barzilai-Borwein method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, Computational experience with numerical methods for nonnegative least-squares problems, A reconstruction algorithm for electrical impedance tomography based on sparsity regularization, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Hybrid spectral gradient method for the unconstrained minimization problem, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, LMBOPT: a limited memory method for bound-constrained optimization, On the rate of convergence of projected Barzilai–Borwein methods, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, A new adaptive Barzilai and Borwein method for unconstrained optimization, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, Subsampled nonmonotone spectral gradient methods, Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Duality-based algorithms for total-variation-regularized image restoration, An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization, On the steplength selection in gradient methods for unconstrained optimization, Nonmonotone spectral method for large-scale symmetric nonlinear equations, A gradient method exploiting the two dimensional quadratic termination property, Shrinking gradient descent algorithms for total variation regularized image denoising, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy, A cyclic projected gradient method, Linear convergence analysis of the use of gradient projection methods on total variation problems, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Gradient-based method with active set strategy for $\ell _1$ optimization, Modified active set projected spectral gradient method for bound constrained optimization, A harmonic framework for stepsize selection in gradient methods, Impulse noise removal by a nonmonotone adaptive gradient method, Iterative regularization algorithms for constrained image deblurring on graphics processors, The chaotic nature of faster gradient descent methods, Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, Variable metric techniques for forward-backward methods in imaging, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, An efficient gradient method using the Yuan steplength, A Riemannian nonmonotone spectral method for self-adjoint tangent vector field, Prediction-correction method with BB step sizes, A cyclic block coordinate descent method with generalized gradient projections, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, Steplength selection in gradient projection methods for box-constrained quadratic programs, A box constrained gradient projection algorithm for compressed sensing, Notes on the Dai-Yuan-Yuan modified spectral gradient method, Gradient descent and fast artificial time integration, On efficiency of nonmonotone Armijo-type line searches, A globally optimal tri-vector method to solve an ill-posed linear system, Barzilai-Borwein-like methods for the extreme eigenvalue problem, An affine scaling method for optimization problems with polyhedral constraints, A convexity enforcing \(C^0\) interior penalty method for the Monge-Ampère equation on convex polygonal domains, An affine-scaling interior-point CBB method for box-constrained optimization, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Scaling Techniques for $\epsilon$-Subgradient Methods, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications, On projected alternating BB methods for variational inequalities, On the inexact scaled gradient projection method, On \(R\)-linear convergence analysis for a class of gradient methods, A family of spectral gradient methods for optimization, A scalable computational platform for particulate Stokes suspensions, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, Scaling techniques for gradient projection-type methods in astronomical image deblurring, An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems, Hybrid limited memory gradient projection methods for box-constrained optimization problems, A wedge trust region method with self-correcting geometry for derivative-free optimization, Diagonal BFGS updates and applications to the limited memory BFGS method, Nomonotone spectral gradient method for sparse recovery
Uses Software
