|January 8th, 2017, 01:40 PM||#1|
Joined: Jan 2017
From: los angeles
Consider an optimization problem,
minimize f(Ax)+x^T x
the variable is n-vector x. The matrix A has size m by n and rank m. f is not necessarily differentiable or convex.
Show that the problem can be formulated as an equivalent problem with m variables, by making change of y = Ax.
|Thread||Thread Starter||Forum||Replies||Last Post|
|Optimization problem||PhizKid||Calculus||1||December 13th, 2012 05:04 AM|
|Optimization Problem||Xetman||Calculus||2||December 8th, 2012 07:34 PM|
|Optimization Problem||MrCones||Calculus||2||November 22nd, 2012 12:15 PM|
|Optimization Problem||mathman2||Calculus||5||November 30th, 2009 07:39 PM|
|Optimization Problem||Mishka||Calculus||4||January 18th, 2009 07:55 AM|