QCQP module

OpenSEFA.QCQPModule — Module

Reformulate a nonlinear reconciliation problem as a quadratically constrained quadratic program (QCQP).

The QCQP form follows the notation of Boyd & Vandenberghe (2007):

minimize  f0(x) = xᵀ P0 x + q0ᵀ x + r0
s.t.      fi(x) = xᵀ Pi x + qiᵀ x + ri = 0,  i = 1, …, m

where P0 = Q⁻¹ is the inverse of the measurement covariance matrix. Variables are ordered as measured → unmeasured → fixed.

See also: https://stanford.edu/~boyd/papers/pdf/qcqp.pdf

source
Base.convert — Method

Convert a reconciliation problem into a quadratically constrained quadratic program.

source