Name: optimization and operations research: proceedings of a conference held at oberwolfach, july 27 - august 2, 1975 (en Alemán)
Price: 172394.00 COP
Availability: InStock
Author: Oettli, W. ; Ritter, K.
ISBN: 9783540076162

portada optimization and operations research: proceedings of a conference held at oberwolfach, july 27 - august 2, 1975 (en Alemán)

optimization and operations research: proceedings of a conference held at oberwolfach, july 27 - august 2, 1975 (en Alemán)

Formato

Libro Físico

Ilustrado por

W. Oettli

K. Ritter

Editorial

Springer

Autor

Oettli, W. ; Ritter, K.

Año

1976

Idioma

Alemán

N° páginas

318

Encuadernación

Tapa Blanda

Dimensiones

24.4 x 17.0 x 1.8 cm

Peso

0.52 kg.

ISBN

3540076166

ISBN13

9783540076162

Categorías

Economía
Investigación científica
Jardinería

optimization and operations research: proceedings of a conference held at oberwolfach, july 27 - august 2, 1975 (en Alemán)

W. Oettli (Ilustrado por) · K. Ritter (Ilustrado por) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 14 a 20 días háb.

$ 344.788$ 172.394

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 172.394

¡Envío Gratis! Llega entre el 13 Jul y el 23 Jul a Bogota, Cundinamarca. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "optimization and operations research: proceedings of a conference held at oberwolfach, july 27 - august 2, 1975 (en Alemán)"

The variable metric algorithm is widely recognised as one of the most efficient ways of solving the following problem: - Locate x* a local minimum point n ( 1) of f(x) x E R Considerable attention has been given to the study of the convergence prop- ties of this algorithm especially for the case where analytic expressions are avai- ble for the derivatives g. = af/ax. i 1 --- n - (2) In particular we shall mention the results of Wolfe (1969) and Powell (1972), (1975). Wolfe established general conditions under which a descent algorithm will converge to a stationary point and Powell showed that two particular very efficient algorithms that cannot be shown to satisfy , olfe's conditions do in fact converge to the minimum of convex functions under certain conditions. These results will be st- ed more completely in Section 2. In most practical problems analytic expressions for the gradient vector g (Equ. 2) are not available and numerical derivatives are subject to truncation error. In Section 3 we shall consider the effects of these errors on Wolfe's convergent prop- ties and will discuss possible modifications of the algorithms to make them reliable in these circumstances. The effects of rounding error are considered in Section 4, whilst in Section 5 these thoughts are extended to include the case of on-line fu- tion minimisation where each function evaluation is subject to random noise.