Catálogo de publicaciones - libros

Compartir en
redes sociales

Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms

Jan A. Snyman

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2005 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-0-387-24348-1

ISBN electrónico

978-0-387-24349-8

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer Science+Business Media, Inc. 2005

Cobertura temática

matematica

Matemáticas

Tabla de contenidos

doi: 10.1007/0-387-24349-6_1

Introduction

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 1-32

doi: 10.1007/0-387-24349-6_2

Line Search Descent Methods for Unconstrained Minimization

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 33-55

doi: 10.1007/0-387-24349-6_3

Standard Methods for Constrained Optimization

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 57-96

doi: 10.1007/0-387-24349-6_4

New Gradient-Based Trajectory and Approximation Methods

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 97-150

doi: 10.1007/0-387-24349-6_5

Example Problems

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 151-205

doi: 10.1007/0-387-24349-6_6

Some Theorems

Jan A. Snyman

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 207-231