Nonmonotone curvilinear line search methods for unconstrained optimization

DOI10.1007/BF00249642zbMath0860.90111OpenAlexW2050193462MaRDI QIDQ1816399

Stefano Lucidi, Michael C. Ferris, Massimo Roma

Publication date: 26 November 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249642

zbMATH Keywords

global convergenceunconstrained minimizationapproximate Newton directioncurvilinear linesearchnonmonotone stabilization strategy

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method, A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization, Adaptive nonmonotone line search method for unconstrained optimization, Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, Iterative grossone-based computation of negative curvature directions in large-scale optimization, Using negative curvature in solving nonlinear programs, Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion, Iterative computation of negative curvature directions in large scale optimization, An unconstrained optimization method using nonmonotone second order Goldstein's line search, A curvilinear method based on minimal-memory BFGS updates, Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs, A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization, A symmetric rank-one quasi-Newton line-search method using negative curvature directions, Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems, A dwindling filter line search method for unconstrained optimization

Uses Software

• LANCELOT
• CUTEr
• tn
• PATH Solver
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmonotone trust region methods with curvilinear path in unconstrained optimization
• Nonmonotonic trust region algorithm
• Nonmonotone stabilization methods for nonlinear equations
• Truncated-Newton algorithms for large-scale unconstrained optimization
• A New Modified Cholesky Factorization
• Newton-Type Minimization via the Lanczos Method
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Preconditioners for Indefinite Systems Arising in Optimization
• Newton-type methods for unconstrained and linearly constrained optimization
• Solution of Sparse Indefinite Systems of Linear Equations
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method
• Computing Modified Newton Directions Using a Partial Cholesky Factorization
• CUTE
• A Nonmonotone Line Search Technique for Newton’s Method
• Modified Cholesky Factorizations for Sparse Preconditioners