Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-011-9960-x / rank
Normal rank
 
Property / review text
 
Making use of the three-term conjugate gradient methods by \textit{Y. Narushima, H. Yabe} and \textit{J. A. Ford} [SIAM J. Optim. 21, No. 1, 212--230 (2011; Zbl 1250.90087)], the authors propose three-term conjugate gradient methods based on secant conditions for unconstrained optimization problems and prove the global convergence of the methods. Special-purpose three-term conjugate gradient methods based on structured secant conditions are also given together with applying them to nonlinear least squares problems and some numerical experiments.
Property / review text: Making use of the three-term conjugate gradient methods by \textit{Y. Narushima, H. Yabe} and \textit{J. A. Ford} [SIAM J. Optim. 21, No. 1, 212--230 (2011; Zbl 1250.90087)], the authors propose three-term conjugate gradient methods based on secant conditions for unconstrained optimization problems and prove the global convergence of the methods. Special-purpose three-term conjugate gradient methods based on structured secant conditions are also given together with applying them to nonlinear least squares problems and some numerical experiments. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Do Van Luu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C53 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6062505 / rank
 
Normal rank
Property / zbMATH Keywords
 
three-term conjugate gradient methods
Property / zbMATH Keywords: three-term conjugate gradient methods / rank
 
Normal rank
Property / zbMATH Keywords
 
secant conditions
Property / zbMATH Keywords: secant conditions / rank
 
Normal rank
Property / zbMATH Keywords
 
global convergence
Property / zbMATH Keywords: global convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
unconstrained optimization problems
Property / zbMATH Keywords: unconstrained optimization problems / rank
 
Normal rank
Property / zbMATH Keywords
 
descent search directions
Property / zbMATH Keywords: descent search directions / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEr / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-011-9960-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039084584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Modified Conjugate Gradient Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New conjugacy conditions and related nonlinear conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear conjugate gradient method based on the MBFGS secant condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-step nonlinear conjugate gradient methods for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW NONLINEAR CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some descent three-term conjugate gradient methods and their global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New quasi-Newton equation and related methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified BFGS method and its global convergence in nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-step quasi-Newton methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Term PRP-Based Descent Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient descent nonlinear conjugate gradient methods with conjugacy condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence theory for the structured BFGS secant method with an application to nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and Superlinear Convergence for Partially Known Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-011-9960-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:40, 9 December 2024

scientific article
Language Label Description Also known as
English
Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
scientific article

    Statements

    Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    31 July 2012
    0 references
    Making use of the three-term conjugate gradient methods by \textit{Y. Narushima, H. Yabe} and \textit{J. A. Ford} [SIAM J. Optim. 21, No. 1, 212--230 (2011; Zbl 1250.90087)], the authors propose three-term conjugate gradient methods based on secant conditions for unconstrained optimization problems and prove the global convergence of the methods. Special-purpose three-term conjugate gradient methods based on structured secant conditions are also given together with applying them to nonlinear least squares problems and some numerical experiments.
    0 references
    0 references
    three-term conjugate gradient methods
    0 references
    secant conditions
    0 references
    global convergence
    0 references
    unconstrained optimization problems
    0 references
    descent search directions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers