3 ms·
Not OP, but probably Convex Optimization [1]. [1] https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
by zekrioca 4y ago
Not OP, but probably Convex Optimization [1].
[1] https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
- Bimos 4y agoOr maybe branch-and-bound? Useful but not that mathematical.
- chisquared 4y agoJudging 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.