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. 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. This book will be of interest to graduate students and researchers in operations research, theoretical statistics, data mining, complexity theory, computational geometry, and computational science.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9781611974379
Quantité disponible : 15 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. N° de réf. du vendeur 2c2f70a18f9fb422d3d92e1fd37fc9f6
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 27700429-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur LU-9781611974379
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 27700429
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 2016. Paperback. . . . . . N° de réf. du vendeur V9781611974379
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 27700429-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 1st edition. 163 pages. 10.00x6.90x0.40 inches. In Stock. N° de réf. du vendeur __1611974372
Quantité disponible : 2 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : 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. N° de réf. du vendeur 9781611974379
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 163. N° de réf. du vendeur 371902893
Quantité disponible : 3 disponible(s)