Convex Optimization

Description
<span></span><p dir="ltr"><span>Convex optimization is a subfield of general optimization problems that strives to minimize convex functions over convex sets. Some special cases include linear programming, quadratic programming, quadratically constrained quadratic programing, etc.</span></p><br/><p dir="ltr"><span>More information on:</span></p><p dir="ltr"><span><a href="http://en.wikipedia.org/wiki/Convex_optimization">http://en.wikipedia.org/wiki/Convex_optimization</a></span></p><a href="http://www.joptimizer.com/"><span>http://www.joptimizer.com/</span></a>
Discussion
  • {{comment.username}}
Status
Active
submission(s) pending review
Bounty expires in
Bounty expired
Bounty
100
Tags
(no tags)