Prove optimization of nonconvex function is NP-hard

Math Geeks

machine learning machine learning course machine learning projects machine learning python machine learning tutorial non convex function is np hard optimization of non convex function optimization of non convex function is np hard theoretical computer science theory of computation theory of computing

description

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 ... https://www.youtube.com/watch?v=BMHI4GzaXeU

created

2022-05-19

staked

0.0 LBC

license

Copyrighted (contact publisher)

File size

14084824 Bytes