The first book in the area, this volume addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Michael J. Todd is Leon C. Welch Professor Emeritus of the School of Operations Research and Information Engineering at Cornell University. He received a Guggenheim Fellowship (1980-1981), a Sloan Research Fellowship (1981-1985), the George B. Dantzig Prize (1988) and the John von Neumann Theory Prize (2003). He is an INFORMS Fellow and a SIAM Fellow. He has served on the editorial boards of Mathematics of Operations Research, Operations Research, and the SIAM Journal on Optimization. He was also Managing Editor of Foundations of Computational Mathematics and has served on the boards of Acta Numerica and Foundations and Trends in Optimization. He is the author of one book and the co-editor of five others.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers FW-9781611974379
Anzahl: 15 verfügbar
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Zustand: new. Bestandsnummer des Verkäufers 2c2f70a18f9fb422d3d92e1fd37fc9f6
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 27700429-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Paperback. Zustand: New. This book, the first on these topics, addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space, which has applications in computational geometry, data representations, and optimal design in statistics. The book covers the formulation of this and related problems, theoretical properties of their optimal solutions, and algorithms for their solution. Due to the high dimensionality of these problems, first-order methods that require minimal computational work at each iteration are attractive. While algorithms of this kind have been discovered and rediscovered over the past fifty years, their computational complexities and convergence rates have only recently been investigated. The optimization problems in the book have the entries of a symmetric matrix as their variables, so the author's treatment also gives an introduction to recent work in matrix optimization.Provides historical perspective on the problems studied by optimizers, statisticians, and geometric functional analysts.Demonstrates the huge computational savings possible by exploiting simple updates for the determinant and the inverse after a rank-one update.Highlights the difficulties in algorithms when related problems are studied that do not allow simple updates at each iteration.Gives rigorous analyses of the proposed algorithms, MATLAB codes, and computational results. Bestandsnummer des Verkäufers LU-9781611974379
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 27700429
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 2016. Paperback. . . . . . Bestandsnummer des Verkäufers V9781611974379
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 27700429-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 1st edition. 163 pages. 10.00x6.90x0.40 inches. In Stock. Bestandsnummer des Verkäufers __1611974372
Anzahl: 2 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. This book, the first on these topics, addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space, which has applications in computational geometry, data representations, and optimal design in statistics. The book covers the formulation of this and related problems, theoretical properties of their optimal solutions, and algorithms for their solution. Due to the high dimensionality of these problems, first-order methods that require minimal computational work at each iteration are attractive. While algorithms of this kind have been discovered and rediscovered over the past fifty years, their computational complexities and convergence rates have only recently been investigated. The optimization problems in the book have the entries of a symmetric matrix as their variables, so the authors treatment also gives an introduction to recent work in matrix optimization.Provides historical perspective on the problems studied by optimizers, statisticians, and geometric functional analysts.Demonstrates the huge computational savings possible by exploiting simple updates for the determinant and the inverse after a rank-one update.Highlights the difficulties in algorithms when related problems are studied that do not allow simple updates at each iteration.Gives rigorous analyses of the proposed algorithms, MATLAB codes, and computational results. Addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space, which has applications in computational geometry, data representations, and optimal design in statistics. The book covers the formulation of this and related problems, theoretical properties of their optimal solutions, and algorithms for their solution. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9781611974379
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 163. Bestandsnummer des Verkäufers 371902893
Anzahl: 3 verfügbar