### Table 2: Duality for closed conic convex programs

"... In PAGE 23: ...d #03 = inf 8 #3E #3C #3E : s 5 #0C #0C #0C #0C #0C #0C #0C 2 6 4 0 1 0 1 s 2 s 5 = p 2 0 s 5 = p 2 0 3 7 5 #17 0 9 #3E = #3E ; = 1: Finally, the possibility of the entries in Table2 where weak infeasibility is not involved, can be demonstrated by a 2-dimensional linear programming problem: Example 5 Let n =2,c2#3C 2 ,K=K #03 =#3C 2 + and A = f#28x 1 ;x 2 #29jx 1 =0g; A ? =f#28s 1 ;s 2 #29js 2 =0g: We see that #28P#29 is strongly feasible if c 1 #3E 0,weakly feasible if c 1 =0and strongly infeasible if c 1 #3C 0. Similarly, #28D#29 is strongly feasible if c 2 #3E 0,weakly feasible if c 2 =0and strongly infeasible if c 2 #3C 0.... In PAGE 27: ... #0F The regularizedprogram CP#28b; c; A; K 0 #29 is dual strongly infeasible if and only if F D = ;. Combining Theorem 8 with Table2 , we see that the regularized conic convex program is in perfect duality: Corollary 7 Assume the same setting as in Theorem 8. Then there holds #0F If d #03 = 1, then the regularized primal CP#28b; c; A; K 0 #29 is either infeasible or unbounded.... ..."

### Table 1: Duality

2006

"... In PAGE 21: ...roof. See Jockusch/Shore [12, Theorem 3.1]. We shall see that the Duality Theorem provides a powerful method of passing from lowness properties to highness properties as in Table1 . The meaning of Table 1 is that, if we have a uniformly relativizable construction of an r.... In PAGE 21: ...roof. See Jockusch/Shore [12, Theorem 3.1]. We shall see that the Duality Theorem provides a powerful method of passing from lowness properties to highness properties as in Table 1. The meaning of Table1 is that, if we have a uniformly relativizable construction of an r.e.... ..."

Cited by 5

### Table 1: Duality

"... In PAGE 21: ...roof. See Jockusch/Shore [12, Theorem 3.1]. square We shall see that the Duality Theorem provides a powerful method of passing from lowness properties to highness properties as in Table1 . The meaning of Table 1 is that, if we have a uniformly relativizable construction of an r.... In PAGE 21: ...roof. See Jockusch/Shore [12, Theorem 3.1]. square We shall see that the Duality Theorem provides a powerful method of passing from lowness properties to highness properties as in Table 1. The meaning of Table1 is that, if we have a uniformly relativizable construction of an r.e.... ..."

### Table 1 Galerkin duality vs. electromagnetic duality Galerkin duality Electromagnetic duality

in Abstract

2005

### Table I Duality relationships

### Table 1: Duality Mappings

"... In PAGE 22: ... We define D D to be the dual of D . We define the dual exactly in Table1 . In this mapping we show how points in D maptoplanesinD... ..."

### Table 1: Summary of applications of various configurations of conics

2004

"... In PAGE 6: ... The algorithms are simple and do not require correspondences of a large number of conics or the solution of multivariate polynomial equations. A summary of the results is shown in Table1 . Extensions to these methods which handle over determined sets of equations, obtained due to the presence of more than two coplanar conics, need to be explored.... ..."

Cited by 4

### Table 1: Thermal and electrical duality

2006

"... In PAGE 2: ... PRELIMINARY 2.1 Thermal Model There is a well-known duality between electrical and thermal systems (See Table1 ). As temperature is analogous to voltage, the heat ow can be modeled by a current passing though a pair of thermal resistance and capacitance driven by the current source, modeling the power dissipation.... ..."

Cited by 1