On an additive function on the set of ideals of an arbitrary number field
Tianxin Cai (1995)
Acta Arithmetica
Similarity:
Tianxin Cai (1995)
Acta Arithmetica
Similarity:
Jonas Koko (2000)
Applicationes Mathematicae
Similarity:
The conjugate gradient method of Liu and Storey is an efficient minimization algorithm which uses second derivatives information, without saving matrices, by finite difference approximation. It is shown that the finite difference scheme can be removed by using a quasi-Newton approximation for computing a search direction, without loss of convergence. A conjugate gradient method based on BFGS approximation is proposed and compared with existing methods of the same class.
Zeilberger, Dominique, Zeilberger, Doron (1983)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Paule, Peter (1987)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Mikihito Hirabayashi (1998)
Acta Arithmetica
Similarity:
Arenas, Francisco García, Puertas, María Luz (2002)
Divulgaciones Matemáticas
Similarity:
De Cecco, Giuseppe, Palmieri, Giuliana (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Foata, Dominique, Han, Guo-Niu (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Emilija Nešović, Miroslava Petrović-Torgašev (2003)
Kragujevac Journal of Mathematics
Similarity:
Rolando Cavazos-Cadena, Raúl Montes-de-Oca (2000)
Applicationes Mathematicae
Similarity:
This work concerns controlled Markov chains with finite state space and nonnegative rewards; it is assumed that the controller has a constant risk-sensitivity, and that the performance ofa control policy is measured by a risk-sensitive expected total-reward criterion. The existence of optimal stationary policies isstudied within this context, and the main resultestablishes the optimalityof a stationary policy achieving the supremum in the correspondingoptimality equation, whenever the...