January 8th, 2017, 12:40 PM  #1 
Newbie Joined: Jan 2017 From: los angeles Posts: 2 Thanks: 0  optimization problem
Consider an optimization problem, minimize f(Ax)+x^T x the variable is nvector 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. Thanks. 

Tags 
optimization, problem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Optimization problem  PhizKid  Calculus  1  December 13th, 2012 04:04 AM 
Optimization Problem  Xetman  Calculus  2  December 8th, 2012 06:34 PM 
Optimization Problem  MrCones  Calculus  2  November 22nd, 2012 11:15 AM 
Optimization Problem  mathman2  Calculus  5  November 30th, 2009 06:39 PM 
Optimization Problem  Mishka  Calculus  4  January 18th, 2009 06:55 AM 