User - MathOverflowmost recent 30 from http://mathoverflow.net2013-05-24T14:53:52Zhttp://mathoverflow.net/feeds/user/26030http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/105767/non-convex-optimizationnon convex optimizationunknown (google)2012-08-28T21:46:30Z2012-08-29T11:40:00Z
<p>Hi there,
In my studies I come up with this nonconvex optimization problem
argmin |Ax|_2+lamda*|x|_1 subject to x'x=1
where cost function is nonsmooth but convex and the constrant in nonconvex.
I tries subgradient projection method for convex constraints but the global solution is not my desired solution.
My question is that I should solve this problem hurestically or there is a reliable method for this nonconvex optimization problem?</p>
http://mathoverflow.net/questions/105767/non-convex-optimization/105799#105799Comment by 2012-08-29T20:01:43Z2012-08-29T20:01:43ZThanks for these papers.http://mathoverflow.net/questions/105767/non-convex-optimization/105816#105816Comment by 2012-08-29T20:00:41Z2012-08-29T20:00:41ZThis trick seems interesting but I have no explicit data term in misfit functional and I am solving system of homogenous equations and data term is in the A matrix. So I have problem in using Alternating-Projection approaches with no b in the misfit functional.