4 ms·
If nothing else whatever field this is from has very fancy sounding jargon. From another post on the site "I researched various different approaches to this pr
by wNk6A23YB 10y ago
If nothing else whatever field this is from has very fancy sounding jargon.
From another post on the site "I researched various different approaches to this problem and implemented the algorithms Conjugate Projected Gradient, Projected Steepest Descent, Projected Gauss-Seidel, Subspace Minimization with Conjugate Gradient, Minimum Residual and Symmetric LQ solvers, as well as Projected Gauss-Seidel with line search using the Armijo rule."
- auxym 10y agoThese are almost all algorithms I've either heard about or actually implemented in a graduate level numerical methods course given in a mechanical engineering department. Nothing extremely esoteric but it depends on your background. I've no clue about most classic CS algorithms (dijkstra, algo for tree structures, etc).
- wNk6A23YB 10y agoI ran Subspace Minimization with Conjugate Gradient on your post and find it satisfactory.
- jtmcmc 10y agoThey're all various optimization technique, variations on gradient descent.