E-Books →Convex Optimization-Theory, Algorithms and Applications

Free Download Convex Optimization-Theory, Algorithms and Applications
English | 2025 | ISBN: 9819789060 | 705 Pages | PDF EPUB (True) | 63 MB
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.