Imagen de Google Jackets

Approximation Methods for Polynomial Optimization [electronic resource] : Models, Algorithms, and Applications / by Zhening Li, Simai He, Shuzhong Zhang.

Por: Colaborador(es): Tipo de material: TextoTextoSeries SpringerBriefs in Optimization | SpringerBriefs in OptimizationEditor: New York, NY : Springer New York : Imprint: Springer, 2012Descripción: VIII, 124 p. online resourceTipo de contenido:
  • text
Tipo de medio:
  • computer
Tipo de soporte:
  • online resource
ISBN:
  • 9781461439844
Trabajos contenidos:
  • SpringerLink (Online service)
Tema(s): Formatos físicos adicionales: Sin títuloClasificación CDD:
  • 519.6 23
Clasificación LoC:
  • QA402.5-402.6
Recursos en línea:
Contenidos:
Springer eBooksResumen: Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications. This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

1. Introduction.-2. Polynomial over the Euclidean Ball -- 3. Extensions of the Constraint Sets -- 4. Applications -- 5. Concluding Remarks.

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications. This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.

ZDB-2-SMA

No hay comentarios en este titulo.

para colocar un comentario.