MCPcopy Index your code
hub / github.com/andeya/algorithm / Sdp

Function Sdp

cvx/solvers.go:296–438  ·  view source on GitHub ↗

Solves a pair of primal and dual SDPs minimize c'*x subject to Gl*x + sl = hl mat(Gs[k]*x) + ss[k] = hs[k], k = 0, ..., N-1 A*x = b sl >= 0, ss[k] >= 0, k = 0, ..., N-1 maximize -hl'*z - sum_k trace(hs[k]*zs[k]) - b'*y subject to Gl'*zl + sum_k Gs[k]'*vec(zs[k]) + A'*y + c = 0 zl >= 0, z

(c, Gl, hl, A, b *matrix.FloatMatrix, Ghs *sets.FloatMatrixSet, solopts *SolverOptions,
	primalstart, dualstart *sets.FloatMatrixSet)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 14

SetMethod · 0.95
SumMethod · 0.95
SumSquaredMethod · 0.95
SetMethod · 0.95
ConeLpFunction · 0.85
RowsMethod · 0.65
ColsMethod · 0.65
SizeMatchMethod · 0.65
AtMethod · 0.45
SqrtMethod · 0.45
SetIndexesFromArrayMethod · 0.45
FloatArrayMethod · 0.45

Tested by

no test coverage detected