Modified line search strategy and its applications in the Newton method

zbMATH Open1348.90530MaRDI QIDQ2829776FDOQ2829776

Authors: Zhong Wan, Xiaodong Zheng, Yunyun Fei, Songhai Deng 

Publication date: 8 November 2016

Published in: International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: http://www.ceser.in/ceserp/index.php/ijamas/article/view/680

Recommendations

• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
• A new trust region method with line search and its convergence property
• New cautious BFGS algorithm based on modified Armijo-type line search
• New inexact line search method for unconstrained optimization
• Convergence of descent method with new line search

zbMATH Keywords

global convergenceunconstrained optimizationdescent algorithminexact line search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cited In (5)

• A new robust line search technique based on Chebyshev polynomials
• A Newton method with a two-dimensional line search
• A hybrid-line-and-curve search globalization technique for inexact Newton methods
• Further insight into the Shamanskii modification of Newton method
• New cautious BFGS algorithm based on modified Armijo-type line search

This page was built for publication: Modified line search strategy and its applications in the Newton method

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