A new method for unconstrained optimization problem

DOI10.5539/MAS.V4N10P133MaRDI QIDQ3070495zbMATHOpenAlexFDO

Authors Zhiguang Zhang

Publication date 3 February 2011

Published in Modern Applied Science (Search for Journal in Brave)

Full work available at URL http://www.ccsenet.org/journal/index.php/mas/article/view/7655

zbMATH Keywords

global convergencememory gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 6001261
• A new class of memory gradient methods and its global convergence
• scientific article; zbMATH DE number 5951924
• Global convergence of a memory gradient method for unconstrained optimization
• A new memory gradient method and its convergence

Cited in

(8)

• On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
• scientific article; zbMATH DE number 1424368 (Why is no real title available?)
• A new memoryless method based on weak quasi-Newton equations
• A new unidimensional search method for optimization: the 5/9 method
• scientific article; zbMATH DE number 2130407 (Why is no real title available?)
• Theoretical efficiency of a new inexact method of tangent hyperbolas
• scientific article; zbMATH DE number 5631038 (Why is no real title available?)
• Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

This page was built for publication: A new method for unconstrained optimization problem

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