[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.11533202 [View]
File: 300 KB, 856x1400, 80558064_p0.jpg [View same] [iqdb] [saucenao] [google]
11533202

I'm working on an unconstrained nonconvex optimization problem. However, when I include a particular set of linear constraints, the problem seems to become convex (it always converges to the same solution for any intial guess, and this is the case for all the methods I tried).
How do I prove the constrained case is convex (or how I disprove it, if my conjecture is wrong)?

Navigation
View posts[+24][+48][+96]