Artículos relacionados a Nonlinear Programming and Variational Inequality Problems:...

Nonlinear Programming and Variational Inequality Problems: A Unified Approach: 23 (Applied Optimization) - Tapa dura

 
9780792354550: Nonlinear Programming and Variational Inequality Problems: A Unified Approach: 23 (Applied Optimization)

Sinopsis

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi­ mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal­ ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi­ mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal­ ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

Reseña del editor

The framework of algorithms presented in this book is called Cost Approximation. It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the updating of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of the book is to offer this framework as an intuitively appealing tool for describing an algorithm. Another purpose is to provide a convergence analysis of the algorithms in the framework.
Audience: The book will be of interest to all researchers in the field (it includes over 800 references) and can also be used for advanced courses in non-linear optimization with the possibility of being oriented either to algorithm theory or to the numerical aspects of large-scale nonlinear optimization.

"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar usado

Ehem. Bibliotheksexemplar mit Signatur...
Ver este artículo

EUR 7,00 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Comprar nuevo

Ver este artículo

EUR 19,49 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

9781441948069: Nonlinear Programming and Variational Inequality Problems: A Unified Approach: 23 (Applied Optimization)

Edición Destacada

ISBN 10:  1441948066 ISBN 13:  9781441948069
Editorial: Springer, 2010
Tapa blanda

Resultados de la búsqueda para Nonlinear Programming and Variational Inequality Problems:...

Imagen del vendedor

Patriksson, Michael:
Publicado por Springer, 1999
ISBN 10: 0792354559 ISBN 13: 9780792354550
Antiguo o usado Tapa dura

Librería: Antiquariat Bookfarm, Löbnitz, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sq 1029 9780792354550 Sprache: Englisch Gewicht in Gramm: 550. Nº de ref. del artículo: 2099601

Contactar al vendedor

Comprar usado

EUR 23,30
Convertir moneda
Gastos de envío: EUR 7,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Michael Patriksson
Publicado por Springer US, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Antiguo o usado Tapa dura

Librería: Buchpark, Trebbin, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: Gut. Zustand: Gut | Seiten: 356 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 3029187/203

Contactar al vendedor

Comprar usado

EUR 19,32
Convertir moneda
Gastos de envío: EUR 14,90
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Michael Patriksson
Publicado por Springer US, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura
Impresión bajo demanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather di. Nº de ref. del artículo: 5968667

Contactar al vendedor

Comprar nuevo

EUR 136,16
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Patriksson, Michael
Publicado por Springer, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9780792354550_new

Contactar al vendedor

Comprar nuevo

EUR 165,06
Convertir moneda
Gastos de envío: EUR 5,17
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Michael Patriksson
Publicado por Springer US Nov 1998, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement. 356 pp. Englisch. Nº de ref. del artículo: 9780792354550

Contactar al vendedor

Comprar nuevo

EUR 160,49
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Patriksson, Michael
Publicado por Springer, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: 756092-n

Contactar al vendedor

Comprar nuevo

EUR 159,20
Convertir moneda
Gastos de envío: EUR 17,14
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Michael Patriksson
Publicado por Springer US, Springer US, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement. Nº de ref. del artículo: 9780792354550

Contactar al vendedor

Comprar nuevo

EUR 168,73
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen del vendedor

Patriksson, Michael
Publicado por Springer, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: GreatBookPricesUK, Woodford Green, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: 756092-n

Contactar al vendedor

Comprar nuevo

EUR 165,05
Convertir moneda
Gastos de envío: EUR 17,27
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Michael Patriksson
Publicado por Springer US, Springer US Nov 1998, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: Neu. Neuware -Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 356 pp. Englisch. Nº de ref. del artículo: 9780792354550

Contactar al vendedor

Comprar nuevo

EUR 160,49
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Patriksson, Michael
Publicado por Springer, 1998
ISBN 10: 0792354559 ISBN 13: 9780792354550
Nuevo Tapa dura

Librería: BennettBooksLtd, North Las Vegas, NV, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

hardcover. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-0792354559

Contactar al vendedor

Comprar nuevo

EUR 175,16
Convertir moneda
Gastos de envío: EUR 37,72
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Existen otras 7 copia(s) de este libro

Ver todos los resultados de su búsqueda