A modified two-point stepsize gradient algorithm for unconstrained minimization

DOI10.1080/10556788.2012.667811MaRDI QIDQ2867423zbMATH OpenOpenAlexFDO

Authors Saman Babaie-Kafaki, Masoud Fatemi

Publication date 19 December 2013

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2012.667811

zbMATH Keywords

unconstrained optimizationconvexitynonmonotone line searchmodified secant equationtwo-point stepsize gradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical methods based on nonlinear programming (49M37) Convexity of real functions of several variables, generalizations (26B25) Methods of reduced gradient type (90C52)

Recommendations

• Modified two-point stepsize gradient methods for unconstrained optimization
• scientific article; zbMATH DE number 5370773
• A new two-step gradient-type method for large-scale unconstrained optimization
• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• Two-step conjugate gradient method for unconstrained optimization
• Two-Point Step Size Gradient Methods
• Two modified conjugate gradient methods for solving unconstrained optimization and application
• An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization
• A modified conjugate gradient method for unconstrained optimization
• Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Cites work

• A Modified BFGS Algorithm for Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A modified BFGS method and its global convergence in nonconvex minimization
• A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Benchmarking optimization software with performance profiles.
• CUTEr and SifDec
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Methods of conjugate gradients for solving linear systems
• Modified two-point stepsize gradient methods for unconstrained optimization
• New quasi-Newton equation and related methods for unconstrained optimization
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• On the Barzilai and Borwein choice of steplength for the gradient method
• On the asymptotic directions of the s-dimensional optimum gradient method
• On the limited memory BFGS method for large scale optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• R-linear convergence of the Barzilai and Borwein gradient method

Cited in

(7)

• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• A new conjugate gradient method with an efficient memory structure
• Adaptive two-point stepsize gradient algorithm
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
• A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
• Structured two-point stepsize gradient methods for nonlinear least squares
• Modified two-point stepsize gradient methods for unconstrained optimization

Describes a project that uses

Uses Software

• CUTEr

This page was built for publication: A modified two-point stepsize gradient algorithm for unconstrained minimization

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