MFKnockoffs.knocks.solve_sdp: Optimization for SDP knockoffs
In MFKnockoffs: Model-Free Knockoff Filter for Controlled Variable Selection

Description Usage Arguments Details Value See Also

Solves the optimization problem needed to create SDP knockoffs using an interior point method

1	MFKnockoffs.knocks.solve_sdp(Sigma, gaptol = 1e-06, maxit = 1000)

`Sigma`	A positive-definite correlation matrix
`gaptol`	Tolerance for duality gap as a fraction of the value of the objective functions (default 1e-6)
`maxit`	The maximum number of iterations for the solver (default: 1000)

Solves the semidefinite programming problem:

\mathrm{maximize} \; \mathrm{sum}(s) \quad \mathrm{subject} \; \mathrm{to} 0 <= s <= 1, \; 2Σ - \mathrm{diag}(s) >= 0

If the matrix Sigma supplied by the user is a non-scaled covariance matrix (i.e. its diagonal entries are not all equal to 1), then the appropriate scaling is applied before solving the SDP defined above. The result is then scaled back before being returned, as to match the original scaling of the covariance matrix supplied by the user.

The solution s to the semidefinite programming problem defined above

Other Optimize knockoffs: MFKnockoffs.knocks.solve_asdp, MFKnockoffs.knocks.solve_equi

MFKnockoffs documentation built on May 2, 2019, 6:33 a.m.