Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
A new descent algorithm with curve search rule for unconstrained minimization | IEEE Conference Publication | IEEE Xplore

A new descent algorithm with curve search rule for unconstrained minimization


Abstract:

In the paper we present a new descent algorithm with curve search rule for unconstrained minimization problems. At each iteration, the next iterative point is determined ...Show More

Abstract:

In the paper we present a new descent algorithm with curve search rule for unconstrained minimization problems. At each iteration, the next iterative point is determined by means of a curve search rule. It is particular that the search direction and the step size is determined simultaneously at each iteration of the new algorithm. Similarly to conjugate gradient methods, the algorithm avoids the computation and storage of some matrices associated with the Hessian of objective functions. It is suitable to solve large scale minimization problems. Numerical experiments show that our algorithm is effective in practical computation.
Date of Conference: 13-14 September 2010
Date Added to IEEE Xplore: 22 November 2010
ISBN Information:
Conference Location: Wuhan
No metrics found for this document.

I. Introduction

Let be an n-dimensional Euclidean space and is a continuously differentiable function. Unconstrained minimization problem (UP) is to find the minimal point of over , denoted by\min f(x),\quad x\in R^{n}.

Most of the well-known methods for solving (UP) take the formx_{k+1}=x_{k}+\alpha_{k}d_{k}, k=1,2, \ldots, \eqno\hbox{(1)}
where is a search direction of at and is a positive step-size. If is the current point, we denote by by and by , respectively.

Usage
Select a Year
2025

View as

Total usage sinceFeb 2011:52
00.511.522.53JanFebMarAprMayJunJulAugSepOctNovDec200000000000
Year Total:2
Data is updated monthly. Usage includes PDF downloads and HTML views.
Contact IEEE to Subscribe

References

References is not available for this document.