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, …, mwhere 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
OpenSEFA.QCQPModule.QCQP — Type
Alias for quadratically constrained quadratic program.
OpenSEFA.QCQPModule.QuadraticConstraint — Type
Constraint of the form x^T * P * x + q^T * x + r = 0.
If there are no bilinear terms, then iszero(P) holds.
OpenSEFA.QCQPModule.QuadraticallyConstrainedQuadraticProgram — Type
Representation of a nonlinear reconciliation optimization problem as a quadratically constrained quadratic program.
Base.convert — Method
Convert a bilinear equation into a quadratic constraint.
Base.convert — Method
Convert a reconciliation problem into a quadratically constrained quadratic program.
OpenSEFA.ConstraintsModule.is_linear — Method
Whether the constraint is linear.
OpenSEFA.QCQPModule.evaluate_gradient_unsafe! — Method
Evaluate the gradient f(x) = r + <q, x> + <x, Px> on x = u which is ∇f(x) = q + (P + P')x.
OpenSEFA.QCQPModule.evaluate_unsafe — Method
Evaluate the constraint f(x) = r + <q, x> + <x, Px> on x = u.