Dogleg paths and trust region methods with back tracking technique for unconstrained optimization

DOI10.1016/j.amc.2005.10.044zbMath1101.65065MaRDI QIDQ2496353

Cheng-Jing Wang

Publication date: 12 July 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.10.044

zbMATH Keywords

algorithm; unconstrained optimization; global convergence; numerical results; trust region method; negative curvature; curvilinear search; line search techniques; factorization of indefinite matrices

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C55: Methods of successive quadratic programming type

Related Items

A curvilinear method based on minimal-memory BFGS updates

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• On the closed form solution of Troesch's problem
• Decomposition of a symmetric matrix
• Nonmonotonic trust region algorithm
• Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
• Nonmonotone adaptive trust-region method for unconstrained optimization problems
• Nonmonotone trust region method for solving optimization problems
• Testing Unconstrained Optimization Software
• A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Curvilinear path and trust region in unconstrained optimization: A convergence analysis
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations