|January 8th, 2017, 01:34 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||atari||Calculus||3||March 6th, 2016 08:45 PM|
|Optimization Problem .. Please help||fantom2012||Calculus||6||April 25th, 2012 10:41 PM|
|need help for optimization problem||latzi||Calculus||1||July 24th, 2009 05:05 PM|
|Optimization problem||wonger357||Calculus||1||May 15th, 2009 12:42 PM|
|Optimization Problem||a.a||Calculus||0||April 19th, 2008 10:54 PM|