Dual QP solver of Goldfarb and Idnani

Please give an identification text (without blank or comma) here:

Please specify the dimension of your problem n:
n = Important: 1 <= n <=100 !

Please specify the number of your equality constraints p:
p = Important: 0 <= p <= n

Please specify the number of your inequality constraints m:
m = Important: 0 <= m <= 300 !

Please specify the n × n matrix G here:
Type the nonzero entries and the lower triangle only, in the form index1,index2, value, each triple in one row.

G =

Please specify n-dimensional vector g₀ here:
Type the nonzero values in the form index, value, rowwise. The objective function reads (1/2)x^TGx -x^Tg₀

g₀ =

Please specify the n × p matrix H here:
Type the nonzero vales only in the form index1, index2, value. index1 corresponds to the variable number and index2 to the equality number.

H =

Please specify the p-dimensional vector h₀ here:
Type the nonzero values only, in the form index,value, rowwise.

h₀ =

Please specify n × m -Matrix C here:
Please type the nonzero values only, rowwise, and each in the form index1,index2, wert .

C =

Please specify m-dimensional vector c₀ here:
Type the nonzero values here rowwise, in the form index,value.

c₀ =

Please specify the amount of output:

The results of the intermediate steps

The final results only and your input data.

Click on "evaluate", in order to submit your input.

back to the info page
Back to the top!
23.06.2010

	The results of the intermediate steps
	The final results only and your input data.