凸優化第九章無約束優化 作業題

無約束優化

The solution to the following problem

with  and m>n, where A has full (column) rank n, is

Which stopping criteria are reasonable when solving an optimization problem

minimize  f(x)

using iterative algorithms? Here  denotes the value of x at iteration t, and ϵ is some small, fixed constant and  is the optimal value.

 爲啥第一個選項不對？？

梯度下降方法

When the gradient descent method is started from a point near the solution, it will converge very quickly.

最速下降方法

In descent methods, the particular choice of search direction does not matter so much.

In descent methods, the particular choice of line search does not matter so much.