Matlab solver for unconstrained convex optimization
2 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Hancheng Zhu
el 2 de Dic. de 2023
Respondida: John D'Errico
el 2 de Dic. de 2023
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.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/1558519/image.png)
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/1558524/image.png)
I use fminunc function in matlab, but it is too slow. Does matlab have some accelerated solver for the above unconstrained convex optimization?
0 comentarios
Respuesta aceptada
John D'Errico
el 2 de Dic. de 2023
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 comentarios
Más respuestas (0)
Ver también
Categorías
Más información sobre Quadratic Programming and Cone Programming en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!