Multivariate spectral gradient method for unconstrained optimization
From MaRDI portal
Recommendations
- A multivariate spectral projected gradient method for bound constrained optimization
- A survey of the spectral gradient method
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- scientific article; zbMATH DE number 5733681
- scientific article; zbMATH DE number 7663620
- scientific article; zbMATH DE number 6001946
- A new spectral gradient method for unconstrained optimization
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Adaptive two-point stepsize gradient algorithm
- Convergence of line search methods for unconstrained optimization
- Convergence of nonmonotone line search method
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Modified two-point stepsize gradient methods for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone trust region method for solving optimization problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the nonmonotone line search
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- Preconditioned spectral gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(16)- A new gradient method via quasi-Cauchy relation which guarantees descent
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations
- A modified multivariate spectral gradient algorithm for solving absolute value equations
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations
- scientific article; zbMATH DE number 6001946 (Why is no real title available?)
- A survey of the spectral gradient method
- An adaptive prediction-correction method for solving large-scale nonlinear systems of monotone equations with applications
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- A multivariate spectral projected gradient method for bound constrained optimization
- Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
- Complexity guarantees of a class of three-term conjugate gradient algorithms for large-scale non-convex problems and applications
This page was built for publication: Multivariate spectral gradient method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945298)
