### Table 7. Free higher-order monoid.

"... In PAGE 17: ...e., the monoid a233 a87a172 whose elements are generated by the inference rules in Table7 ), and each term constant a222 a209 a208 is mapped into a basic arrow a125a125 a222 a16a126a126 a209 a59 a218 a125a125 a208 a126a126 (where a125a125 a208 a126a126... ..."

### Table 1: Higher Order Correctors as Unblocking Device

2006

"... In PAGE 17: ... When using higher order correctors as an unblocking device we will attempt them even if the Mehrotra corrector has been rejected. Table1 gives results with and without forcing higher order correctors (hoc and no-hoc respectively). The numbers reported are the average number of iteration of the warmstarted problem over all problems in the test set and all 10 random perturbations.... In PAGE 23: ...9 50.4 Table1 0: Results QP (Best Warmstart) - all perturbations 5.5 Large Scale QP Problems Finally we have evaluated our warmstart strategy in the context of two sources of large scale quadratic problems.... In PAGE 29: ...2 60.0 Table1... In PAGE 30: ...0 45.6 Table1... ..."

Cited by 3

### Table 1: Higher Order Correctors as Unblocking Device

2006

"... In PAGE 17: ... When using higher order correctors as an unblocking device we will attempt them even if the Mehrotra corrector has been rejected. Table1 gives results with and without forcing higher order correctors (hoc and no-hoc respectively). The numbers reported are the average number of iteration of the warmstarted problem over all problems in the test set and all 10 random perturbations.... In PAGE 23: ...9 50.4 Table1 0: Results QP (Best Warmstart) - all perturbations 5.5 Large Scale QP Problems Finally we have evaluated our warmstart strategy in the context of two sources of large scale quadratic problems.... In PAGE 29: ...2 60.0 Table1... In PAGE 30: ...0 45.6 Table1... ..."

Cited by 3

### Table 5: Higher order correction and times without certain features for HOPDM

1999

"... In PAGE 10: ... The problems that HOPDM solves using the NE factorization are 1, 4, 5, 6, 9, 11, and 15. The last column of Table5 lists the times obtained when in all cases the opposite factorization method was forced. Signi cant improvements are possible, particularly for problems 1, 10, 11.... ..."

Cited by 7

### Table 1: Inference rules of higher order logic 1. ASSUME: {P}turnstileleftP

2004

### Table 4: Higher-Order Economic Losses

"... In PAGE 5: ...oss at a single site is $3.6 million. In addition to environmental losses, other higher-order eco- nomic losses are possible in a large New Madrid earthquake. Table4 lists some of these higher-order losses and the pa- rameters that influence their levels (Eguchi et al., 1993; Wiggins, 1994).... ..."

### Table 6. E ciency of higher order methods. Problem Order 1 Order 2 Order 3 Order 4

1994

"... In PAGE 24: ...actorization is very expensive compared with a single solve (see, e.g., [4] for details). We end this section with a demonstration of the use of higher order techniques. Table6 reports the number of iterations to reach 8{digits precision in the duality gap and the CPU time for several Netlib problems for di erent order methods. The method of order 1 is a pure primal{dual one in which the direction comes from the solution of (7).... In PAGE 24: ... The method of order k computes k ? 1 corrector terms. The analysis of results collected in Table6 shows that the use of higher order information may reduce the number of iterations to reach optimality. However, this translates into computation time savings only in a case when Cholesky factorizations are very expensive (compare to the data of Table 4).... ..."

Cited by 14

### Table 6. E ciency of higher order methods. Problem Order 1 Order 2 Order 3 Order 4

1994

"... In PAGE 24: ...see, e.g., [4] for details). We end this section with a demonstration of the use of higher order techniques. Table6 reports the number of iterations to reach 8{digits precision in the duality gap and the CPU time for several Netlib problems for di erent order methods. The method of order 1 is a pure primal{dual one in which the direction comes from the solution of (7).... In PAGE 24: ... The method of order k computes k ? 1 corrector terms. The analysis of results collected in Table6 shows that the use of higher order information may reduce the number of iterations to reach optimality. However, this translates into computation time savings only in a case when Cholesky factorizations are very expensive (compare to the data of Table 4).... ..."

Cited by 14

### Tabling for higher-order logic programming

2003

Cited by 17