Sparsity pattern of Jacobian for fmincon
3 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Hello
I am busy with a multiple shooting trajectory optimization problem. I would like to attempt this problem in fmincon using interior point as I've heard it is large scale (I have ~4000 variables).
I just wanted to find out if its possible if one can give fmincon the sparsity pattern of the constraint jacobian? I know some of the elements, but others I cannot differentiate analytically.
Thanks in advance!
Amir
0 commentaires
Réponse acceptée
Alan Weiss
le 3 Sep 2015
Modifié(e) : Alan Weiss
le 3 Sep 2015
The fmincon 'trust-region-reflective' algorithm accepts a HessPattern option, but requires you to give an analytic gradient function, so won't be suitable. The 'interior-point' algorithm has no such option, but you can set the Hessian option to 'lbfgs', which saves memory in the Hessian approximation.
And allow me to suggest that you might want to consult Optimizing a Simulation or ODE for suggestions on using optimization routines with an ODE solver. In particular, you might need to take larger-than-default finite difference steps.
Alan Weiss
MATLAB mathematical toolbox documentation
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Solver Outputs and Iterative Display dans Help Center et File Exchange
Produits
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!