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, 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.
"synopsis" may belong to another edition of this title.
Michael J. Todd is Leon C. Welch Professor Emeritus of the School of Operations Research and Information Engineering, 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 SIAM Journal on Optimization. He was Managing Editor of Foundations of Computational Mathematics and served on the boards of Acta Numerica and Foundations and Trends in Optimization. He is the author of one and co-editor of five previous books.
"About this title" may belong to another edition of this title.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 27700429-n
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: 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. Seller Inventory # LU-9781611974379
Quantity: Over 20 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9781611974379
Quantity: 15 available
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Seller Inventory # 2c2f70a18f9fb422d3d92e1fd37fc9f6
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 27700429
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 27700429-n
Quantity: Over 20 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: 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. Seller Inventory # 9781611974379
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 2016. Paperback. . . . . . Seller Inventory # V9781611974379
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 1st edition. 163 pages. 10.00x6.90x0.40 inches. In Stock. Seller Inventory # __1611974372
Quantity: 2 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 163. Seller Inventory # 371902893
Quantity: 3 available