SULJE VALIKKO

avaa valikko

Balendu Bhooshan Upadhyay (ed.) | Akateeminen Kirjakauppa

CONVEX OPTIMIZATION—THEORY, ALGORITHMS AND APPLICATIONS : RTCOTAA-2020, PATNA, INDIA, OCTOBER 29–31

Convex Optimization—Theory, Algorithms and Applications : RTCOTAA-2020, Patna, India, October 29–31
Balendu Bhooshan Upadhyay (ed.); Shashi Kant Mishra (ed.); Pierre Maréchal (ed.)
Springer (2025)
Saatavuus: Tulossa!
Kovakantinen kirja
215,70
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Convex Optimization—Theory, Algorithms and Applications : RTCOTAA-2020, Patna, India, October 29–31
215,70 €
Springer
Sivumäärä: 507 sivua
Asu: Kovakantinen kirja
Painos: 2024
Julkaisuvuosi: 2025, 03.01.2025 (lisätietoa)
Kieli: Englanti

This volume includes chapters on topics presented at the conference on Recent Trends in Convex Optimization: Theory, Algorithms and Applications (RTCOTAA-2020), held at the Department of Mathematics, Indian Institute of Technology Patna, Bihar, India, from 29–31 October 2020. It discusses a comprehensive exploration of the realm of optimization, encompassing both the theoretical underpinnings and the multifaceted real-life implementations of the optimization theory. It meticulously features essential optimization concepts, such as convex analysis, generalized convexity, monotonicity, etc., elucidating their theoretical advancements and significance in the optimization sphere. Multiobjective optimization is a pivotal topic which addresses the inherent difficulties faced in conflicting objectives. The book delves into various theoretical concepts and covers some practical algorithmic approaches to solve multiobjective optimization, such as the line search and the enhanced non-monotone quasi-Newton algorithms. It also deliberates on several other significant topics in optimization, such as the perturbation approach for vector optimization, and solution methods for set-valued optimization. Nonsmooth optimization is extensively covered, with in-depth discussions on various well-known tools of nonsmooth analysis, such as convexificators, limiting subdifferentials, tangential subdifferentials, quasi-differentials, etc.



Notable optimization algorithms, such as the interior point algorithm and Lemke’s algorithm, are dissected in detail, offering insights into their applicability and effectiveness. The book explores modern applications of optimization theory, for instance, optimized image encryption, resource allocation, target tracking problems, deep learning, entropy optimization, etc. Ranging from gradient-based optimization algorithms to metaheuristic approaches such as particle swarm optimization, the book navigates through the intersection of optimization theory and deep learning, thereby unravelling new research perspectives in artificial intelligence, machine learning and other fields of modern science. Designed primarily for graduate students and researchers across a variety of disciplines such as mathematics, operations research, electrical and electronics engineering, computer science, robotics, deep learning, image processing and artificial intelligence, this book serves as a comprehensive resource for someone interested in exploring the multifaceted domain of mathematical optimization and its myriad applications.



Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
LISÄÄ OSTOSKORIIN
Tuote ilmestyy 03.01.2025. Voit tehdä tilauksen heti ja toimitamme tuotteen kun saamme sen varastoomme. Seuraa saatavuutta.
Myymäläsaatavuus
Helsinki
Tapiola
Turku
Tampere
Convex Optimization—Theory, Algorithms and Applications : RTCOTAA-2020, Patna, India, October 29–31
Näytä kaikki tuotetiedot
Sisäänkirjautuminen
Kirjaudu sisään
Rekisteröityminen
Oma tili
Omat tiedot
Omat tilaukset
Omat laskut
Lisätietoja
Asiakaspalvelu
Tietoa verkkokaupasta
Toimitusehdot
Tietosuojaseloste