Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives
by Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Examines evaluation complexity for algorithms solving nonconvex optimization, offering theory, computation, and research perspectives.
About This Book
This book explores the theoretical and computational aspects of evaluating the complexity of algorithms designed for nonconvex optimization.
It provides perspectives on both established methods and emerging approaches in the field.
The work is intended for researchers and practitioners interested in optimization theory and computation.
Reviews
No reviews yet. Be the first to review this book!