Hacker News new | ask | show | jobs
by zekrioca 1335 days ago
Not OP, but probably Convex Optimization [1].

[1] https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
2 comments
chisquared 1335 days ago
Judging from the TOC, everything in Part I of Boyd and Vandenberghe appears in some form in the monograph, so I don't think that's it.
link
Bimos 1335 days ago
Or maybe branch-and-bound? Useful but not that mathematical.
link