Class NullSpaceASS

All Implemented Interfaces:
Optimisation, Optimisation.Solver

class NullSpaceASS extends ConvexSolver
Proof-of-concept solver that eliminates equality constraints, and reduces the number of variables, via a null-space projection and delegates the reduced inequality-only QP to an existing active-set solver.

It constructs x = x0 + Z y, where x0 is a particular solution of AE x = BE and Z spans the null space of AE. Then it solves the reduced problem in y with only inequalities and reconstructs x and multipliers (recovering equality multipliers from the first-order optimality conditions).