PyQuadProg.PyQuadProg

All Samples(8) | Call(4) | Derive(0) | Import(4)

src/o/b/oBB-0.6b/obb/T2_synchronised.py oBB(Download)

 
			# Import QuadProg++ solver
			from PyQuadProg import PyQuadProg
 
			# Check if circle has feasible point
			def mfeasible(c):
 
				# Solve QP to check feasibility
				sol = PyQuadProg(2*identity(D),-2*c.xc,E.transpose(),-1*d,vstack([identity(D),-1*identity(D),-1*A]).transpose(),hstack([-l,u,b]))

src/o/b/oBB-0.6b/obb/T2_individual.py oBB(Download)

 
			# Import QuadProg++ solver
			from PyQuadProg import PyQuadProg
 
			# Check if circle has feasible point
			def mfeasible(c):
 
				# Solve QP to check feasibility
				sol = PyQuadProg(2*identity(D),-2*c.xc,E.transpose(),-1*d,vstack([identity(D),-1*identity(D),-1*A]).transpose(),hstack([-l,u,b]))

src/o/b/oBB-0.6b/obb/T1.py oBB(Download)

 
			# Import QuadProg++ solver
			from PyQuadProg import PyQuadProg
 
			# Check if circle has feasible point
			def mfeasible(c):
 
				# Solve QP to check feasibility
				sol = PyQuadProg(2*identity(D),-2*c.xc,E.transpose(),-1*d,vstack([identity(D),-1*identity(D),-1*A]).transpose(),hstack([-l,u,b]))

src/o/b/oBB-0.6b/pyquadprog/test.py oBB(Download)

from PyQuadProg import PyQuadProg
from numpy import array
 
G = array([[11., 0], [0, 12]])
CE = array([[1.], [1]])

 
 
qp = PyQuadProg(G, g0, CE, ce0, CI, ci0)
 
print array(qp.x.getArray())