v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.03.2015 Views

156 CHAPTER 2. CONVEX GEOMETRY Ay ≼ K ∗ or in the alternative b (315) x T b < 0, A T x=0, x ≽ derived from (314) simply by taking the complementary sense of the inequality in x T b . These two systems are alternatives; if one system has a solution, then the other does not. 2.57 [266, p.201] By invoking a strict membership relation between proper cones (294), we can construct a more exotic alternative strengthened by demand for an interior point; b − Ay ≻ 0 ⇔ x T b > 0, A T x=0 ∀x ≽ 0, x ≠ 0 (316) K ∗ K From this, alternative systems of generalized inequality [53, pages:50,54,262] K 0 Ay ≺ K ∗ or in the alternative b (317) x T b ≤ 0, A T x=0, x ≽ K 0, x ≠ 0 derived from (316) by taking the complementary sense of the inequality in x T b . And from this, alternative systems with respect to the nonnegative orthant attributed to Gordan in 1873: [135] [48,2.2] substituting A ←A T and setting b = 0 2.57 If solutions at ±∞ are disallowed, then the alternative systems become instead mutually exclusive with respect to nonpolyhedral cones. Simultaneous infeasibility of the two systems is not precluded by mutual exclusivity; called a weak alternative. Ye provides an example illustrating simultaneous [ ] infeasibility[ with respect ] to the positive semidefinite cone: x∈ S 2 1 0 0 1 , y ∈ R , A = , and b = where x 0 0 1 0 T b means 〈x , b〉 . A better strategy than disallowing solutions at ±∞ is to demand an interior point as in (317) or Lemma 4.2.1.1.2. Then question of simultaneous infeasibility is moot.

2.13. DUAL CONE & GENERALIZED INEQUALITY 157 A T y ≺ 0 or in the alternative Ax = 0, x ≽ 0, ‖x‖ 1 = 1 (318) 2.13.3 Optimality condition The general first-order necessary and sufficient condition for optimality of solution x ⋆ to a minimization problem ((275p) for example) with real differentiable convex objective function f(x) : R n →R is [265,3] (confer2.13.10.1) (Figure 59) ∇f(x ⋆ ) T (x − x ⋆ ) ≥ 0 ∀x ∈ C , x ⋆ ∈ C (319) where C is a convex feasible set (the set of all variable values satisfying the problem constraints), and where ∇f(x ⋆ ) is the gradient of f (3.1.8) with respect to x evaluated at x ⋆ . 2.58 In the unconstrained case, optimality condition (319) reduces to the classical rule ∇f(x ⋆ ) = 0, x ⋆ ∈ domf (320) which can be inferred from the following application: 2.13.3.0.1 Example. Equality constrained problem. Given a real differentiable convex function f(x) : R n →R defined on domain R n , a fat full-rank matrix C ∈ R p×n , and vector d∈ R p , the convex optimization problem minimize f(x) x (321) subject to Cx = d is characterized by the well-known necessary and sufficient optimality condition [53,4.2.3] ∇f(x ⋆ ) + C T ν = 0 (322) where ν ∈ R p is the eminent Lagrange multiplier. [264] Feasible solution x ⋆ is optimal, in other words, if and only if ∇f(x ⋆ ) belongs to R(C T ). 2.58 Direct solution to (319) instead is known as a variation inequality from the calculus of variations. [215, p.178] [110, p.37]

156 CHAPTER 2. CONVEX GEOMETRY<br />

Ay ≼<br />

K ∗<br />

or in the alternative<br />

b<br />

(315)<br />

x T b < 0, A T x=0, x ≽<br />

derived from (314) simply by taking the complementary sense of the<br />

inequality in x T b . These two systems are alternatives; if one system has<br />

a solution, then the other does not. 2.57 [266, p.201]<br />

By invoking a strict membership relation between proper cones (294),<br />

we can construct a more exotic alternative strengthened by demand for an<br />

interior point;<br />

b − Ay ≻ 0 ⇔ x T b > 0, A T x=0 ∀x ≽ 0, x ≠ 0 (316)<br />

K ∗ K<br />

From this, alternative systems of generalized inequality [53, pages:50,54,262]<br />

K<br />

0<br />

Ay ≺<br />

K ∗<br />

or in the alternative<br />

b<br />

(317)<br />

x T b ≤ 0, A T x=0, x ≽<br />

K<br />

0, x ≠ 0<br />

derived from (316) by taking the complementary sense of the inequality<br />

in x T b .<br />

And from this, alternative systems with respect to the nonnegative<br />

orthant attributed to Gordan in 1873: [135] [48,2.2] substituting A ←A T<br />

and setting b = 0<br />

2.57 If solutions at ±∞ are disallowed, then the alternative systems become instead<br />

mutually exclusive with respect to nonpolyhedral cones. Simultaneous infeasibility of<br />

the two systems is not precluded by mutual exclusivity; called a weak alternative.<br />

Ye provides an example illustrating simultaneous [ ] infeasibility[ with respect ] to the positive<br />

semidefinite cone: x∈ S 2 1 0<br />

0 1<br />

, y ∈ R , A = , and b = where x<br />

0 0<br />

1 0<br />

T b means<br />

〈x , b〉 . A better strategy than disallowing solutions at ±∞ is to demand an interior<br />

point as in (317) or Lemma 4.2.1.1.2. Then question of simultaneous infeasibility is moot.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!