Nonlinear Programming and Variational Inequality Problems (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
336
Utgivningsdatum
2010-11-16
Upplaga
Softcover reprint of hardcover 1st ed. 1999
Förlag
Springer-Verlag New York Inc.
Illustrationer
XIV, 336 p.
Dimensioner
234 x 156 x 19 mm
Vikt
495 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9781441948069
Nonlinear Programming and Variational Inequality Problems (häftad)

Nonlinear Programming and Variational Inequality Problems

A Unified Approach

Häftad Engelska, 2010-11-16
2389
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
Beställ boken senast måndag 30 november för leverans innan julafton
Finns även som
Visa alla 2 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Nonlinear Programming and Variational Inequality Problems
  2. +
  3. An Introduction to Continuous Optimization: Foundations and Fundamental Algorithms, Third Edition

De som köpt den här boken har ofta också köpt An Introduction to Continuous Optimization: Fou... av Michael Patriksson (häftad).

Köp båda 2 för 2643 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Michael Patriksson

Innehållsförteckning

Preface. 1. Introduction. 2. Technical Preliminaries. 3. Instances of the Cost Approximation Algorithm. 4. Merit Functions for Variational Inequality Problems. 5. Convergence of the CA Algorithm for Nonlinear Programs. 6. Convergence of the CA Algorithm for Variational Inequality Problems. 7. Finite Identification of Active Constraints and of Solutions. 8. Parallel and Sequential Decomposition CA Algorithms. 9. A Column Generation/Simplicial Decomposition Algorithm. A. Definitions. References. Index.