Prove optimization of nonconvex function is NP-hard

Save
3 years ago
3

Prove optimization of nonconvex function is NP-hard

I prove optimization of nonconvex function is NP-hard by reducing the problem into subset sum

Donate to Channel(斗內一下): https://paypal.me/kuoenjui
Facebook: https://www.facebook.com/mathenjui
Instagram: https://www.instagram.com/mathphyen/

Subscribe to my channel

Loading comments...