Convex Optimization. Mikhail Moklyachuk

Чтение книги онлайн.

Читать онлайн книгу Convex Optimization - Mikhail Moklyachuk страница 9

Convex Optimization - Mikhail Moklyachuk

Скачать книгу

then image for sufficiently small x, i.e. image ∈ locmin f. If image, then image for sufficiently small x, i.e. image ∈ locmax f. □

      Let image be a function of n real variables.

      DEFINITION 1.3.– A function f is said to be lower semicontinuous (upper semicontinuous) at a point if there exists a δ-neighborhood

image

       of the point such that the inequality

image

      holds true for all ximage.

      THEOREM 1.8.– A function image is lower semicontinuous on ℝn if and only if for all a ∈ ℝ the set f–1((a, +∞]) is open (or the complementary set f–1 ((–∞, a]) is closed).

      PROOF.– Let f be a lower semicontinuous on ℝn function, let a ∈ ℝ and let image ∈ f–1((a, +∞]). Then there exists a δ-neighborhood image of the point image such that for all points ximage the inequality f(x) > a holds true. This means that image. Consequently, the set f–1((a, +∞]) is open.

      Vice versa, if the set f–1((a, +∞]) is open for any a ∈ ℝ and image ∈ ℝn, then image and the function f is lower semicontinuous at point image by agreement, or image and imagef–1((a, +∞]), when image. Since the set f–1((a, +∞]) is open, then there exists a δ-neighborhood image of the point image such that image and f(x) > a for all ximage. Consequently, the function f is lower semicontinuous at point image. □

      THEOREM 1.9.– (Weierstrass theorem) A lower (upper) semicontinuous on a non-empty bounded closed subset X of the space ℝn function is bounded from below (from above) on X and attains the smallest (largest) value.

      THEOREM 1.10.– (Weierstrass theorem) If a function f(x) is lower semicontinuous and for some number a the set {x: f(x) ≤ a} is non-empty and bounded, then the function f(x) attains its absolute minimum.

      COROLLARY 1.1.– If a function f(x) is lower (upper) semicontinuous on ℝn and

image

      then the function f(x) attains its minimum (maximum) on each closed subset of the space ℝn.

      THEOREM 1.11.– (Necessary conditions of the first order) If image is a point of local extremum of the differentiable at the point image function f(x), then all partial derivatives of the function f(x) are equal to zero at the point image:

image

      THEOREM 1.12.– (Necessary conditions of the second order) If image is a point of local minimum of the function f(x)>, which has the second-order partial derivatives at the point image, then the following condition holds true:

image

      This condition means that the matrix

image

      is non-negative definite.

      THEOREM 1.13.– (Sufficient conditions of the second order) Let a function image have the second-order partial derivatives at a point image and let the following conditions hold true:

image

      Then image is the point of local minimum of the function f(x).

      The second condition of the theorem means that the matrix

image

      is positive definite.

      THEOREM

Скачать книгу