4 ms·
Remark: Optimization by Boyd and Vanderberghe is actually Convex optimization. It doesn't cover non-convex stuff.
by philip-b 8y ago
Remark: Optimization by Boyd and Vanderberghe is actually Convex optimization. It doesn't cover non-convex stuff.
- govg 8y agoOf course, you're correct. I chose to ignore that aspect since Boyd's book covers a lot of basic material, and I'm not actually aware of any such text covering non-convex methods in general ( and considering how fast research is in this space, I'm not sure of any general work, in contrast to work like [1] ). [1] - Non Convex Optimization for Machine Learning - Jain and Kar (https://arxiv.org/abs/1712.07897 https://arxiv.org/abs/1712.07897)