Discrete Geometry and Optimization

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, t...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Bezdek, Karoly. (Editor), Deza, Antoine. (Editor), Ye, Yinyu. (Editor)
Format: Electronic
Language:English
Published: Heidelberg : Springer International Publishing : Imprint: Springer, 2013.
Series:Fields Institute Communications, 69
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-319-00200-2
LEADER 04589nam a22005175i 4500
001 14220
003 DE-He213
005 20130727075812.0
007 cr nn 008mamaa
008 130709s2013 gw | s |||| 0|eng d
020 # # |a 9783319002002  |9 978-3-319-00200-2 
024 7 # |a 10.1007/978-3-319-00200-2  |2 doi 
050 # 4 |a QA639.5-640.7 
050 # 4 |a QA640.7-640.77 
072 # 7 |a PBMW  |2 bicssc 
072 # 7 |a PBD  |2 bicssc 
072 # 7 |a MAT012020  |2 bisacsh 
072 # 7 |a MAT008000  |2 bisacsh 
082 0 4 |a 516.1  |2 23 
100 1 # |a Bezdek, Karoly.  |e editor. 
245 1 0 |a Discrete Geometry and Optimization  |c edited by Karoly Bezdek, Antoine Deza, Yinyu Ye.  |h [electronic resource] / 
264 # 1 |a Heidelberg :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2013. 
300 # # |a X, 336 p. 56 illus., 34 illus. in color.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
490 1 # |a Fields Institute Communications,  |v 69  |x 1069-5265 ; 
505 0 # |a Preface -- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova) -- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer) -- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher) -- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek) -- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar) -- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis) -- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales) -- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh) -- Techniques for Submodular Maximization (Lee) -- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza) -- Expected Crossing Numbers (Mohar, Stephen) -- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump) -- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini) -- Exploiting Symmetries in Polyhedral Computations (Schurmann) -- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye) -- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena) -- Open Problems (Bezdek, Deza, and Ye). 
520 # # |a Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tt̤h Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems. 
650 # 0 |a Mathematics. 
650 # 0 |a Discrete groups. 
650 1 4 |a Mathematics. 
650 2 4 |a Convex and Discrete Geometry. 
650 2 4 |a Discrete Optimization. 
650 2 4 |a Operations Research, Management Science. 
700 1 # |a Deza, Antoine.  |e editor. 
700 1 # |a Ye, Yinyu.  |e editor. 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319001999 
830 # 0 |a Fields Institute Communications,  |v 69  |x 1069-5265 ; 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-319-00200-2 
912 # # |a ZDB-2-SMA 
950 # # |a Mathematics and Statistics (Springer-11649)