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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.

N� de ref. del art�culo 9781108837590

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Convexity and its Applications in Discrete and Continuous Optimization (Hardcover)
Editor: Cambridge University Press, Cambridge
Fecha de publicaci�n: 2025
Idioma: Ingl�s
ISBN 10: 110883759X
ISBN 13: 9781108837590
Encuadernaci�n: Hardcover
Estado: new

Acerca de

Sinopsis

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.

Acerca del autor

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.

Descripci�n de la librer�a

Online business

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

ABC BOOKS LIMITED
10 John Street, London, WC1N 2EB, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

Orders can be returned within 30 days of receipt.

Condiciones de env�o

Please note that titles are dispatched from our US, Canadian or Australian warehouses. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 7-14 days.