Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems

Table 1

Computed solutions using four different algorithms for Examples 8, 9, 10, and 11.

Examples		KKY	MKKY	Sch-MKKY	MN-MKKY
Example 8		1.1176285677	0.7993104755	0.7992885091	0.7984677572
		0.8925922545	1.2006283419	1.2006478942	1.2013756245
		−0.0102208222	0.0000611826	0.0000635969	0.0001566183
		1.3324440588	0.3980537916	0.3979927208	0.395765081
Example 9		−5.2199797446	0.7514629509	0.7514297188	0.7514274997
		−1.8871925195	0.0000032699	0.0000065967	0.0000068198
		0.4463304312	0.0000010511	0.0000021234	0.0000022020
		0.3791651531	1.0175937272	1.0172339995	1.0172101531
		−0.0087312913	0.0007335551	0.0007190583	0.0007180983
		0.5536695688	0.9999989489	0.9999978766	0.9999977980
		0.6232230772	0.0000006675	0.0000013472	0.0000013940
Example 10		0.0000000025	0.0000000156	0.0000000055	0.0000000080
		1.9999999829	1.9999999858	1.9999999749	1.9999999586
		0.0000000025	0.0000000156	0.0000000055	0.0000000080
Example 11		0.3124560511	0.7142857707	0.7142857350	0.7142857453
		0.3438507936	0.1428572168	0.1428571684	0.1428571600
		0.0001576431	0.0000002101	0.0000000702	0.0000000498
		−1.4064826279	0.0000001087	0.0000000363	0.0000000258