Equality constrained smooth optimization problem:
for f convex, and twice differentiable; for A \in \mathbb{R}^{p\times n}, rank p. additional information equality constrained quadratic minimization say its a quadratic:
for P \in \mathbb{S}^{n}_{+} We can form optimality via the KKT Conditions in a block:
recall that this matrix is nonsingular IFF Ax = 0, x\neq 0 \implies x^{T}Px > 0. equivalently: P + A^{T}A > 0 newton’s method These two methods are identical. eliminating equality conditions Recall we can write:
as
where for F \in \mathbb{R}^{n \times \left(n-p\right)} we have \text{range}\ F = \text{null}\ A (rank F = n-p and AF = 0).
newton step preserving equality constraints \begin{align} \mqty(\nabla^{2}f\left(x\right) & A^{T} \ A & 0) \mqty(v \w) = \mqty(-\nabla f\left(x\right) \ 0) \end{align} this is actually a second-order approximation of the original function:
this is an explicit version infeasible newton’s method With y\left(x,v\right), we write optimality as:
is the “primal-dual residual.” We hope to minimize this (i.e. we want to “minimize the 2-norm of these”.) Consider x \in \text{dom}\left(f\right), and Ax \neq b, such that x is infeasible. If we linearize r=0 at r\left(y+\Delta y\right) \approx r\left(y\right) + D r\left(y\right) \Delta y = 0: