A new method with sufficient descent property for unconstrained optimization

DOI10.1155/2014/940120MaRDI QIDQ1725328zbMATH OpenOpenAlexWikidataFDO

Authors Weiyi Qian, Haijuan Cui

Publication date 14 February 2019

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/940120

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52) Methods of quasi-Newton type (90C53)

Review text

Summary: Recently, sufficient descent property plays an important role in the global convergence analysis of some iterative methods. In this paper, we propose a new iterative method for solving unconstrained optimization problems. This method provides a sufficient descent direction for objective function. Moreover, the global convergence of the proposed method is established under some appropriate conditions. We also report some numerical results and compare the performance of the proposed method with some existing methods. Numerical results indicate that the presented method is efficient.

Recommendations

• A simple sufficient descent method for unconstrained optimization
• A conjugate gradient method with sufficient descent property and its convergence property
• An efficient conjugate gradient method with sufficient descent property
• Descent property and global convergence of a new search direction method for unconstrained optimization
• A descent method for unconstrained optimization problems

Cites work

• \(n\)-step quadratic convergence of the MPRP method with a restart strategy
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A limited memory BFGS-type method for large-scale unconstrained optimization
• A simple sufficient descent method for unconstrained optimization
• A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
• A Two-Term PRP-Based Descent Method
• An unconstrained optimization test functions collection
• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
• Benchmarking optimization software with performance profiles.
• Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• Sufficient descent directions in unconstrained optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The convergence properties of some new conjugate gradient methods
• Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
• Two-Point Step Size Gradient Methods

Cited in

(3)

• A new steepest descent method with global convergence properties
• Sufficient descent directions in unconstrained optimization
• A simple sufficient descent method for unconstrained optimization

This page was built for publication: A new method with sufficient descent property for unconstrained optimization

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