This paper presents a non-monotone curve search method for unconstrained optimization problems and proves its convergence under some mild conditions.
本文提出一类求解无约束优化问题的非单调曲线搜索方法，在较弱条件下证明了其收敛性。
In this paper, a class of new descent algorithm is proposed to solve unconstrained optimization problems.
研究给出了一类新的求解无约束优化问题的下降算法。
The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.
共轭梯度法是求解无约束优化问题的一类有效方法。
A nonmonotonic trust region algorithm with line search for unconstrained optimization problems is presented in this paper.
给出无约束最优化的一类带线搜索的非单调信赖域算法。
By using a modified BFGS formula, a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.
利用一个修正的BFGS公式，提出了结合线搜索技术的BFGS -信赖域方法，并在一定条件下证明了该方法的全局收敛性和超线性收敛性。
Pr conjugate gradient method is one of the efficient methods for solving large scale unconstrained optimization problems, however, its global convergence has not been solved for a long time.
PR共轭梯度法是求解大型无约束优化问题的有效算法之一，但是算法的全局收敛性在理论上一直没有得到解决。
Pr conjugate gradient method is one of the efficient methods for solving large scale unconstrained optimization problems, however, its global convergence has not been solved for a long time.
PR共轭梯度法是求解大型无约束优化问题的有效算法之一，但是算法的全局收敛性在理论上一直没有得到解决。
应用推荐