搜索结果: 1-6 共查到“line search”相关记录6条 . 查询时间(0.289 秒)
A Nonlinear Conjugate Gradient Algorithm with An Optimal Property and An Improved Wolfe Line Search
conjugate gradient method memoryless BFGS method unconstrained optimization global convergence Wolfe line search
2012/8/10
In this paper, we seek the conjugate gradient direction closest to the direction of the
scaled memoryless BFGS method and propose a family of conjugate gradient methods for
unconstrained optimizatio...
There exists a strong connection between numerical methods for the integration of ordinary differential equations and optimization problems. In this paper, we try to discover further their links. And ...
AN SQP ALGORITHM WITH NONMONOTONE LINE SEARCH FOR GENERAL NONLINEARCONSTRAINED OPTIMIZATION PROBLEM
2007/12/11
In this paper, an SQP type algorithm with a new nonmonotone line search
technique for general constrained optimization problems is presented.
The new algorithm does not have to solve the second orde...
The Global Convergence of Self-scale BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems
nonmonotone line search self-scaling BFGS method global convergence
2007/12/11
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenva...
This paper presents a unified framework of the nonmonotone convex combinationalgorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignmentproblems. Global convergence results are estab...
A NEW SUFFICIENT CONDITION FOR THE CONVERGENCE OF THE DFP ALGORITHM WITH WOLFE LINE SEARCH
Global convergence DFP algorithm Wolfe
2007/8/7
The DFP algorithm is one of the mest famous numerical algorithms for unconstrained optimization.It is an open problem whether DFP algorithm with inexact line searches is globally convergent. In this p...