• Keine Ergebnisse gefunden

Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und Statistik

N/A
N/A
Protected

Academic year: 2021

Aktie "Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und Statistik"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und Statistik

Prof. Dr. Stefan Volkwein

Roberta Mancini, Carmen Gräßle, Laura Lippmann, Kevin Sieg

Optimierung

http://www.math.uni-konstanz.de/numerik/personen/volkwein/teaching/

Sheet 3

Deadline for hand-in: 2014/06/04 at lecture Exercise 8

Let b ∈ R n and A ∈ R n×n .

Show that x 0 ∈ R n is a minimal point of ϕ : R n → R , x 7→ ϕ(x) := ||Ax − b|| 2 if and only if the Gaussian normal equation A > Ax 0 = A > b holds.

Exercise 9

Use the characterization given in Exercise 8 to solve the following linear regression prob- lem:

Find a vector of parameters x = (x 1 , x 2 ) ∈ R 2 such that the corresponding regression line γ x : R → R , defined by γ x (t) := x 1 + tx 2 , approximates the following measuring points

t i 1975 1980 1985 1990 1995

γ i 30 35 38 42 44

optimally, i.e. such that x = (x 1 , x 2 ) solves the optimization problem:

x = argmin

x∈ R

2

5

X

i=1

i − γ x (t i )) 2 .

Exercise 10 (4 Points)

Let a, b, c, d vectors in R n , with b, d linear independent. Consider the parametrization of two straight lines x(s) : R → R n and y(t) : R → R n with

x(s) := a + sb , y(t) := c + td (s, t ∈ R ).

Find the critical points of the distance function

(s, t) 7→ ||x(s) − y(t)||

where k · k is intended as Euclidean norm and characterize them.

(2)

Exercise 11

Let f : R → R convex function and a, b ∈ R , with a < b and x ∈ [a, b]. Show that f(x) − f(a)

x − a ≤ f(b) − f (a)

b − a ≤ f (b) − f(x) b − x showing first the following result

f(x) ≤ x − a

b − a f(b) + b − x

b − a f(a).

Referenzen

ÄHNLICHE DOKUMENTE

Compute the point x k+1 using the damped Newton algorithm and compare it to the one returned by the classical Newton method. What do

Determine the number of gradient steps required for finding the minimum of f with the different matrices M and initial value x0 = [1.5;0.6] (use = 10

Herefore, write function files testfunction.m and rosenbrock.m which accept an input argument x and return the function and gradient values at x. Finally, write a file main.m where

Universität Konstanz Sommersemester 2015 Fachbereich Mathematik und

Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und

Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und

Show that for the starting point x 0 = 0, the classical Newton iteration of f has two accumulation points which are both not roots of f.. Find another initial point which does not

Universität Konstanz Sommersemester 2014 Fachbereich Mathematik und