In [1] the unconstrained minimization problem was considered and presented an algorithm without derivative. But the terminative conditions and convergence proof of the algorithm were not given. In this paper, we prese...In [1] the unconstrained minimization problem was considered and presented an algorithm without derivative. But the terminative conditions and convergence proof of the algorithm were not given. In this paper, we present a revised algorithm and prove its convergence.展开更多
A new algorithm for unconstrained optimization is developed, by using the product form of the OCSSR1 update. The implementation is especially useful when gradient information is estimated by difference formulae. Preli...A new algorithm for unconstrained optimization is developed, by using the product form of the OCSSR1 update. The implementation is especially useful when gradient information is estimated by difference formulae. Preliminary tests show that new algorithm can perform well.展开更多
文摘In [1] the unconstrained minimization problem was considered and presented an algorithm without derivative. But the terminative conditions and convergence proof of the algorithm were not given. In this paper, we present a revised algorithm and prove its convergence.
文摘A new algorithm for unconstrained optimization is developed, by using the product form of the OCSSR1 update. The implementation is especially useful when gradient information is estimated by difference formulae. Preliminary tests show that new algorithm can perform well.
