Magical Tome

The outer archives are busy
In Chapter I, we introduce the main classes of global optimization problems that we study: concave minimization, reverse convex constraints, d.c. programming, and Lipschitz optimization.
Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.
Create free accountMarks left by readers of this tome
No community marks yet — be the first to inscribe this tome.
Pacing
Horror / Dark Elements
Romance
Spice Level
LGBTQ+ Representation
Social & Political Themes in Stories