Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers.
"Sinopsis" puede pertenecer a otra edición de este libro.
Amitabh Basu is Professor of Applied Mathematics and Statistics at Johns Hopkins University. He has received the NSF CAREER award and the Egon Balas Prize from the INFORMS Optimization Society. He serves on the editorial boards of 'Mathematics of Operations Research,' 'Mathematical Programming,' 'SIAM Journal on Optimization,' and the 'MOS-SIAM Series on Optimization.'
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 3,40 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoEUR 7,64 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Books From California, Simi Valley, CA, Estados Unidos de America
hardcover. Condición: Fine. Nº de ref. del artículo: mon0003826289
Cantidad disponible: 1 disponibles
Librería: Best Price, Torrance, CA, Estados Unidos de America
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9781108837590
Cantidad disponible: 2 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 49202219-n
Cantidad disponible: 1 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: L2-9781108837590
Cantidad disponible: 2 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 26403862178
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9781108837590
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 49202219
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Nº de ref. del artículo: 409324925
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781108837590_new
Cantidad disponible: 4 disponibles
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
Hardcover. Condición: new. Hardcover. Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers. This rigorous introduction to the fundamental ideas of convexity and their use in optimization offers a unifying approach for both discrete and continuous applications. Students and researchers in optimization, operations research, computer science, and applied mathematics will appreciate the book's 300+ exercises and coverage of new developments. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781108837590
Cantidad disponible: 1 disponibles