Optimization and approximation, Pedregal, Pablo

Автор: Ding-Zhu Du; Jie Sun
Название: Advances in Optimization and Approximation
ISBN: 0792327853 ISBN-13(EAN): 9780792327851
Издательство: Springer
Рейтинг:
Цена: 241310.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Offers a collection of research papers in optimization and approximation that covers the research on optimization problems, including scheduling, location, assignment, linear and nonlinear programming problems as well as problems in molecular biology. This book focuses on algorithmic aspects of research work in optimization.

Автор: Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Ali
Название: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540663290 ISBN-13(EAN): 9783540663294
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text presents various new results within the areas covered by the workshop.

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

Автор: K. Glashoff; S.-A. Gustafson
Название: Linear Optimization and Approximation
ISBN: 0387908579 ISBN-13(EAN): 9780387908571
Издательство: Springer
Рейтинг:
Цена: 88500.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A linear optimization problem is the task of minimizing a linear real-valued function of finitely many variables subject to linear con- straints;

Автор: Marc Lassonde
Название: Approximation, Optimization and Mathematical Economics
ISBN: 379081363X ISBN-13(EAN): 9783790813630
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The articles in this proceedings volume reflect the current trends in the theory of approximation, optimization and mathematical economics, and include numerous applications.

Автор: L. Ljung; G. Pflug; H. Walk
Название: Stochastic Approximation and Optimization of Random Systems
ISBN: 3764327332 ISBN-13(EAN): 9783764327330
Издательство: Springer
Рейтинг:
Цена: 23250.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: PHug) 7 Markovian stochastic optimization and stochastic approximation procedures 53 8 Asymptotic distributions 71 9 Stopping times 79 1O Applications of stochastic approximation methods 80 References for Part II 90 III Applications to adaptation algorithms (L.

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.

Автор: Mahmudov, Elimhan N
Название: Approximation and Optimization of Discrete and Differential Inclu
ISBN: 0323165400 ISBN-13(EAN): 9780323165402
Издательство: Elsevier Science
Рейтинг:
Цена: 121830.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Optimal control theory has numerous applications in both science and engineering. This book presents basic concepts and principles of mathematical programming in terms of set-valued analysis and develops a comprehensive optimality theory of problems described by ordinary and partial differential inclusions.

Автор: Komornik, Vilmos
Название: Topology, calculus and approximation
ISBN: 1447173155 ISBN-13(EAN): 9781447173151
Издательство: Springer
Рейтинг:
Цена: 32600.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejer, Stieltjes, and Turan.

The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Caratheodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations.
Students of both pure and applied mathematics, as well as physics and engineering should find this textbook useful. Only basic results of one-variable calculus and linear algebra are used, and simple yet pertinent examples and exercises illustrate the usefulness of most theorems. Many of these examples are new or difficult to locate in the literature, and so the original sources of most notions and results are given to help readers understand the development of the field.

Автор: Trefethen
Название: Approximation Theory and Approximation Practice
ISBN: 1611972396 ISBN-13(EAN): 9781611972399
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 55440.00 T
Наличие на складе: Невозможна поставка.
Описание: In a book that will appeal to beginners and experts alike, Oxford University’s Nick Trefethen presents approximation theory using a fresh approach for this established field.Approximation Theory and Approximation Practice is a textbook on classical polynomial and rational approximation theory for the twenty-first century. It uses MATLAB? to teach the field’s most important ideas and results and differs fundamentally from other works on approximation theory in a number of ways: its emphasis is on topics close to numerical algorithms; concepts are illustrated with Chebfun; and each chapter is a PUBLISHable Matlab M-file, available online.In addition, the book centers on theorems and methods for analytic functions, which appear so often in applications, rather than on functions at the edge of discontinuity with their seductive theoretical challenges. Original sources are cited rather than textbooks, and each item in the bibliography is accompanied by an editorial comment.Each chapter has a collection of exercises, which span a wide range from mathematical theory to Chebfun-based numerical experimentation.

Автор: Ben-Tal
Название: Lectures on Modern Convex Optimization
ISBN: 0898714915 ISBN-13(EAN): 9780898714913
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 129580.00 T
Наличие на складе: Невозможна поставка.
Описание: Examines well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthesis of filters, Lyapunov stability analysis, and structural design.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.