Convex Analysis and Optimization in Hadamard Spaces (Hardcover, Digital original)

In the past two decades, convex analysis and optimization have been developed in Hadamard spaces. This book represents a first attempt to give a systematic account on the subject. Hadamard spaces are complete geodesic spaces of nonpositive curvature. They include Hilbert spaces, Hadamard manifolds, Euclidean buildings and many other important spaces. While the role of Hadamard spaces in geometry and geometric group theory has been studied for a long time, first analytical results appeared as late as in the 1990s. Remarkably, it turns out that Hadamard spaces are appropriate for the theory of convex sets and convex functions outside of linear spaces. Since convexity underpins a large number of results in the geometry of Hadamard spaces, we believe that its systematic study is of substantial interest. Optimization methods then address various computational issues and provide us with approximation algorithms which may be useful in sciences and engineering. We present a detailed description of such an application to computational phylogenetics. The book is primarily aimed at both graduate students and researchers in analysis and optimization, but it is accessible to advanced undergraduate students as well.

General

Imprint:	De Gruyter
Country of origin:	Germany
Series:	De Gruyter Series in Nonlinear Analysis & Applications
Release date:	September 2014
First published:	2014
Authors:	Miroslav Bacak
Dimensions:	240 x 170mm (L x W)
Format:	Hardcover - Cloth over boards
Pages:	193
Edition:	Digital original
ISBN-13:	978-3-11-036103-2
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	3-11-036103-5
Barcode:	9783110361032

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!