Duality for Nonconvex Approximation and Optimization, Ivan Singer

Автор: Radoslaw Pytlak
Название: Conjugate Gradient Algorithms in Nonconvex Optimization
ISBN: 3642099254 ISBN-13(EAN): 9783642099250
Издательство: Springer
Рейтинг:
Цена: 27251.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book details algorithms for large-scale unconstrained and bound constrained optimization. It shows optimization techniques from a conjugate gradient algorithm perspective as well as methods of shortest residuals, which have been developed by the author.

Автор: Moses Charikar; Klaus Jansen; Omer Reingold; Jos?
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540742077 ISBN-13(EAN): 9783540742074
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 10th International Workshop APPROX 2007 and 11th International Workshop RANDOM 2007 Princeton NJ US.

Автор: Shashi K. Mishra
Название: Topics in Nonconvex Optimization
ISBN: 1461428890 ISBN-13(EAN): 9781461428893
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This contributed volume consists of papers in the area of nonconvex optimization from researchers practicing in India. It aims to bring together new concepts, theoretical developments, and applications from these researchers.

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Автор: Ashish Goel; Klaus Jansen; Jos? Rolim; Ronitt Rubi
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540853626 ISBN-13(EAN): 9783540853626
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.

Автор: Willy Do?rfler
Название: Photonic Crystals : Mathematical Analysis And Numerical Approximation
ISBN: 3034801122 ISBN-13(EAN): 9783034801126
Издательство: Springer
Рейтинг:
Цена: 4191.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: <p>This book concentrates on the mathematics of photonic crystals, which form an important class of physical structures investigated in nanotechnology. Photonic crystals are materials which are composed of two or more different dielectrics or metals, and which exhibit a spatially periodic structure, typically at the length scale of hundred nanometers.</p><p>In the mathematical analysis and the numerical simulation of the partial differential equations describing nanostructures, several mathematical difficulties arise, e. g., the appropriate treatment of nonlinearities, simultaneous occurrence of continuous and discrete spectrum, multiple scales in space and time, and the ill-posedness of these problems.</p><p>This volume collects a series of lectures which introduce into the mathematical background needed for the modeling and simulation of light, in particular in periodic media, and for its applications in optical devices.</p>

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.