Interior Point Method Algorithm

From GM-RKB
Revision as of 17:30, 28 September 2014 by Gmelli (talk | contribs) (Created page with "An Interior Point Method Algorithm is a convex optimization algorithm that uses a a self-concordant barrier function to encode the convex set. * <B>AKA:</B...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

An Interior Point Method Algorithm is a convex optimization algorithm that uses a a self-concordant barrier function to encode the convex set.



References

2014