Research Article
Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems
Table 2
Comparison between four different algorithms for Examples
8,
9,
10, and
11.
| | Examples | Algorithm | | | | Error | CPU time (sec) |
| | Example 8 | KKY (infeasible) | — | — | — | — | — | | MKKY | 549 | 1.4962795449 | −7.1998265727 | | 182.8281 | | Sch-MKKY | 515 | 1.4962672544 | −7.1998196616 | | 153.4063 | | MN-MKKY | 187 | 1.4958093895 | −7.1995511207 | | 83.5313 |
| | Example 9 | KKY (infeasible) | — | — | — | — | — | | MKKY | 181 | 1.6125110840 | −1.3693639744 | | 213.1250 | | Sch-MKKY | 87 | 1.6122679375 | −1.3693475555 | | 122.4229 | | MN-MKKY | 67 | 1.6122518087 | −1.3693463904 | | 79.1875 |
| | Example 10 | KKY | 17 | 1.9999999829 | −3.9999999317 | | 11.4844 | | MKKY | 80 | 1.9999999858 | −3.9999999433 | | 46.5469 | | Sch-MKKY | 37 | 1.9999999749 | −3.9999998994 | | 22.5625 | | MN-MKKY | 15 | 1.9999999586 | −3.9999998343 | | 10.7031 |
| | Example 11 | KKY (infeasible) | — | — | — | — | — | | MKKY | 61 | 0.7284314289 | −0.2039626101 | | 35.7188 | | Sch-MKKY | 30 | 0.7284313844 | −0.2039626256 | | 18.4531 | | MN-MKKY | 12 | 0.7284313929 | −0.2039626212 | | 9.0781 |
|
|
