Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint

Class Summary

Class	Description
AntoniouLu2007	This implementation is based on Algorithm 14.5 in the reference.
PrimalDualInteriorPointMinimizer	Solves a Dual Second Order Conic Programming problem using the Primal Dual Interior Point algorithm.
PrimalDualInteriorPointMinimizer1	The SOCP dual problem we are solving here is : \max {\bm b}^T \hat{\bm y} \\ {\rm s.t.}
PrimalDualSolution	The vector set {x, s, y} is a solution to both the primal and dual SOCP problems.
SDPT3v4	This implements Algorithm_IPC, the SOCP interior point algorithm in SDPT3 version 4.
SDPT3v4_1a	This implements Algorithm_IPC, the SOCP interior point algorithm in SDPT3 version 4.
SDPT3v4_1b	This implements Algorithm_IPC, the SOCP interior point algorithm in SDPT3 version 4.