Linear algebra -- Optimization -- Conjugate gradients for unconstrained minimization -- Equality constrained minimization -- Bound constrained minimization -- Bound and equality constrained minimization -- Solution of a coercive variational inequality by FETI-DP method -- Solution of a semi-coercive variational inequality by TFETI method
Summary
'Optimal Quadratic Programming Algorithms' presents recently developed algorithms for solving large QP problems. The presentation focuses on algorithms which are, in a sense optimal, i.e. they can solve important classes of problems at the cost proportional to the number of unknowns
