Matlab solver for unconstrained convex optimization
显示 更早的评论
I have a large scale unconstrained convex optimization problem as follows
min 
, where 
and u are N-dimensional vectors, λ is a scalar. They are all provided before optimization. Here, M and N are very large.
, where and u are N-dimensional vectors, λ is a scalar. They are all provided before optimization. Here, M and N are very large.I use fminunc function in matlab, but it is too slow. Does matlab have some accelerated solver for the above unconstrained convex optimization?
采纳的回答
John D'Errico
2023-12-2
1 个投票
Everybody wants things to be incredibly fast. Large problems can take large time.
Nothing stops you from writing a simple gradient descent solver. Put a line search on it. Will it work well? Who knows.
In fact, I see that fminunc can perform a simple gradient descent scheme.
In there, we see the flag to cause fminunc to use gradient descent.
Finally, if the objective function is as simple as you show, then you will probably gain by providing the Jacobian yourself, instead of letting it compute the gradient using a finite difference.
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Nonlinear Optimization 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
