<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Convex optimization - Page 13 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Convex_optimization&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Convex_optimization&amp;p=14">3.Next</a>
</p>
<p>to solve are the unconstrained problems, or the problems with only equality constraints. As the equality constraints are all linear, they can be eliminated with <a href="page.php?w=linear_algebra">linear algebra</a> and integrated into the objective, thus converting an equality-constrained problem into an unconstrained one. </p>

<p>In the class of unconstrained (or equality-constrained) problems, the simplest ones are those in which the objective is <a href="page.php?w=Quadratic_programming">quadratic</a>. For these problems, the <a href="page.php?w=KKT_conditions">KKT conditions</a></p><p>
<a accesskey="1" href="page.php?w=Convex_optimization&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Convex_optimization&amp;p=14">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
