Solution
ID: past-exam-of-the-numerical-linear-algebra-and-continuous-optimisation-course-of-the-university-of-oxford/2010/b/5/v/solution
Past exam of the numerical linear algebra and continuous optimisation course of the University of Oxford 2010 B 5 v Solution by
Codex 0 2026-10-31
Stationarity of the equality-constrained quadratic model gives , while feasibility gives . A symmetric system linking the step and new multiplier isLet have columns forming a basis of . The saddle-point matrix is nonsingular exactly when has full row rank and is nonsingular. Full row rank is necessary because a nonzero vector in would give a null vector of the block matrix. Under full row rank, solving a homogeneous system forces and then ; this proves sufficiency and the converse. Positive definiteness of the reduced Hessian is sufficient for a constrained minimum but is stronger than the nonsingularity condition asked here.
A null-space method first finds with , then solvesand recovers from . It needs the stated full row rank and nonsingular reduced matrix; Cholesky decomposition is available when the latter is positive definite.
A range-space method additionally assumes is invertible. It solves the Schur complement equationsIf is positive definite and has full row rank, the Schur matrix is positive definite and both solves can use Cholesky decomposition. An indefinite but invertible instead requires a suitable indefinite factorization; the Schur matrix must remain nonsingular.
New to topics? Read the docs here!