Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

Convex Optimization as a book category covers the mathematical theory, computational methods, and practical applications of optimization problems in which the objective and feasible region are convex, guaranteeing globally optimal solutions and powerful duality properties. Titles in this category range from introductory texts that develop convex sets and functions, optimality conditions, and basic algorithms (gradient methods, subgradient, projection) to advanced treatments of interior-point methods, conic and semidefinite programming, and convex duality and geometry. Books may be theoretical (proofs, complexity, and functional analysis), algorithmic (implementation details, convergence rates, software/toolbox use), or application-focused (machine learning, signal processing, control, finance, network design). They typically assume undergraduate-level calculus and linear algebra and appeal to students, researchers, and practitioners who need reliable, scalable methods for modeling and solving real-world optimization problems.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.