Two-Point Step Size Gradient Methods

DOI10.1093/IMANUM/8.1.141zbMATH Open0638.65055OpenAlexW2076605490WikidataQ56935973 ScholiaQ56935973MaRDI QIDQ3779680FDOQ3779680

Authors: Jonathan Barzilai, Jonathan M. Borwein 

Publication date: 1988

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/8.1.141

Recommendations

• Modified two-point stepsize gradient methods for unconstrained optimization
• Adaptive two-point stepsize gradient algorithm
• A new stepsize for the steepest descent method
• Two novel gradient methods with optimal step sizes
• Step-sizes for the gradient method

zbMATH Keywords

convergencenumerical examplessteepest-descent methodunconstrained minimization secant method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Cited In (only showing first 100 items - show all)

• A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
• An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
• Convex constrained optimization for large-scale generalized Sylvester equations
• Modified nonmonotone Armijo line search for descent method
• A practical method for solving large-scale TRS
• Impulse noise removal by a nonmonotone adaptive gradient method
• Large correlation analysis
• A class of line search-type methods for nonsmooth convex regularized minimization
• Spectral gradient methods for linearly constrained optimization
• A non-monotonic method for large-scale non-negative least squares
• Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
• Two maxentropic approaches to determine the probability density of compound risk losses
• A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems
• Lifetime dependence modelling using a truncated multivariate gamma distribution
• On the asymptotic convergence and acceleration of gradient methods
• Convergence properties of nonmonotone spectral projected gradient methods
• On \(R\)-linear convergence analysis for a class of gradient methods
• Scaling techniques for gradient projection-type methods in astronomical image deblurring
• An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
• Semi-supervised learning with nuclear norm regularization
• Computing extreme eigenvalues of large scale Hankel tensors
• Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems
• Convergence of descent method without line search
• Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
• Global optimization with orthogonality constraints via stochastic diffusion on manifold
• Maximum entropy and feasibility methods for convex and nonconvex inverse problems
• Global convergence of a spectral conjugate gradient method for unconstrained optimization
• Spectral conjugate gradient methods for vector optimization problems
• Inexact variable metric method for convex-constrained optimization problems
• An augmented Lagrangian method for optimization problems with structured geometric constraints
• Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
• A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
• Geometric interpretation of some Cauchy related methods
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming
• A note on the spectral gradient projection method for nonlinear monotone equations with applications
• Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
• Accelerated gradient descent methods with line search
• Convergence analysis for the modified spectral projected subgradient method
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• Minimization algorithms based on supervisor and searcher cooperation
• Adaptive choice of the Tikhonov regularization parameter to solve ill-posed linear algebraic equations via Liapunov optimizing control
• A Barzilai-Borwein type method for stochastic linear complementarity problems
• Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem
• A nonmonotone filter Barzilai-Borwein method for optimization
• Convergence properties of inexact projected gradient methods
• A feasible filter method for the nearest low-rank correlation matrix problem
• A Barzilai-Borwein type method for minimizing composite functions
• Norm descent conjugate gradient methods for solving symmetric nonlinear equations
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
• The new spectral conjugate gradient method for large-scale unconstrained optimisation
• Exact spectral-like gradient method for distributed optimization
• A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
• A nonmonotone line search method for noisy minimization
• Spectral gradient method for impulse noise removal
• A class of diagonal quasi-Newton methods for large-scale convex minimization
• On iterative algorithms for quantitative photoacoustic tomography in the radiative transport regime
• Derivative-Free Bayesian Inversion Using Multiscale Dynamics
• Obituary: Jonathan M. Borwein (1951--2016). Homo sapiens, homo ludens
• Smooth and adaptive gradient method with retards
• Faster gradient descent and the efficient recovery of images
• Iterative methods for the elastography inverse problem of locating tumors
• A limited memory descent Perry conjugate gradient method
• Unconstrained optimization techniques for the acceleration of alternating projection methods
• The matrix pencil nearness problem in structural dynamic model updating
• Inexact alternating direction methods of multipliers for separable convex optimization
• A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
• Nomonotone spectral gradient method for sparse recovery
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• An efficient augmented Lagrangian method with applications to total variation minimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• A new generalized shrinkage conjugate gradient method for sparse recovery
• Gradient descent and fast artificial time integration
• 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
• Algorithms that satisfy a stopping criterion, probably
• On Hager and Zhang's conjugate gradient method with guaranteed descent
• Operator splittings, Bregman methods and frame shrinkage in image processing
• Variational Bayesian strategies for high-dimensional, stochastic design problems
• The chaotic nature of faster gradient descent methods
• A PRP type method for systems of monotone equations
• An efficient gradient method using the Yuan steplength
• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
• Spectral scaling BFGS method
• Duality-based algorithms for total-variation-regularized image restoration
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• A limited memory steepest descent method
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
• Applying powell's symmetrical technique to conjugate gradient methods
• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
• On some steplength approaches for proximal algorithms
• Scaled conjugate gradient algorithms for unconstrained optimization
• Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
• A new analysis on the Barzilai-Borwein gradient method
• Two modified scaled nonlinear conjugate gradient methods

This page was built for publication: Two-Point Step Size Gradient Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779680)