Modified two-point stepsize gradient methods for unconstrained optimization
From MaRDI portal
Publication:1610315
DOI10.1023/A:1014838419611zbMath1008.90056OpenAlexW1497566274MaRDI QIDQ1610315
Yu-Hong Dai, Ya-Xiang Yuan, Jin Yun Yuan
Publication date: 19 August 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014838419611
unconstrained optimizationnonmonotone line searchtwo-point stepsize gradient methodsteepest descent method
Related Items
A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization ⋮ Hybrid spectral gradient method for the unconstrained minimization problem ⋮ A trust region spectral method for large-scale systems of nonlinear equations ⋮ A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ Gradient projection methods for quadratic programs and applications in training support vector machines ⋮ Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization ⋮ A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems ⋮ Scaling on the spectral gradient method ⋮ Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ Structured two-point stepsize gradient methods for nonlinear least squares ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems ⋮ A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method for unconstrained minimization ⋮ A scaled nonlinear conjugate gradient algorithm for unconstrained optimization ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A new gradient method via least change secant update ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ Accelerated diagonal gradient-type method for large-scale unconstrained optimization ⋮ A class of accelerated subspace minimization conjugate gradient methods ⋮ Multivariate spectral gradient method for unconstrained optimization ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization ⋮ Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ Nonmonotone adaptive trust region method with line search based on new diagonal updating ⋮ Two new conjugate gradient methods based on modified secant equations ⋮ Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming ⋮ Notes on the Dai-Yuan-Yuan modified spectral gradient method ⋮ Optimization-based Shrinking Dimer Method for Finding Transition States ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ Accelerated gradient descent methods with line search ⋮ On sparse beamformer design with reverberation ⋮ An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization ⋮ Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization ⋮ A new gradient method via quasi-Cauchy relation which guarantees descent ⋮ A new trust region method with adaptive radius ⋮ The new spectral conjugate gradient method for large-scale unconstrained optimisation ⋮ A spectral conjugate gradient method for nonlinear inverse problems ⋮ The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation ⋮ A descent algorithm without line search for unconstrained optimization ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems ⋮ A modified two-point stepsize gradient algorithm for unconstrained minimization ⋮ Accelerated multiple step-size methods for solving unconstrained optimization problems ⋮ A CLASS OF MODIFIED BFGS METHODS WITH FUNCTION VALUE INFORMATION FOR UNCONSTRAINED OPTIMIZATION ⋮ Diagonal BFGS updates and applications to the limited memory BFGS method
Uses Software
This page was built for publication: Modified two-point stepsize gradient methods for unconstrained optimization
