100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
MATH6184-exercise-3.pdf £7.16   Add to cart

Lecture notes

MATH6184-exercise-3.pdf

 0 view  0 purchase

Lecture notes of 2 pages for the course machine learning at Abacus College, Oxford (MATH)

Preview 1 out of 2  pages

  • September 20, 2024
  • 2
  • 2024/2025
  • Lecture notes
  • Unknown
  • All classes
All documents for this subject (8)
avatar-seller
1097434525U
Prof Dr Jörg Fliege Semester 2, 2022/2023
School of Mathematical Sciences
University of Southampton



MATH6184 — Optimization Part

Exercise Sheet 3

You are not required to hand in the answers to these problems.

1. Consider the box-constrained nonlinear optimization problem

min (x1 − 5)2 − 2x1 x2 + 10(x2 − 10)2
subject to 0 ≤ x1 ≤ 3,
0 ≤ x2 ≤ 5.

For the starting point x = (2.5, 0)T , do the following:

(a) execute the descent algorithm for box-constrained optimization using the steepest
descent direction,
(b) execute the descent algorithm for box-constrained optimization using Newton’s
direction.

As a stopping criterion, you can employ ε = 0.01. As parameter for the Armijo criterion,
you can employ δ = 0.01.

2. Consider the same optimization problem as in exercise 1.

(a) Transform the problem into a sequence of unconstrained optimization problems
with objective function Fr by using four penalty functions of the form as depicted
on slide 28, Section 3. (It is sufficient to use just one penalty parameter r here.)
(b) For x1 > 3 and x2 > 5, compute the unconstrained minimum x(r) of the function
Fr .
(c) How does x(r) behave for r −→ +∞? Compare your results with exercise 1.

3. Consider the following nonlinear optimization problem:

max 2(x1 − 3)2 − x1 x2 + (x2 − 5)2
subject to x21 + x22 ≤ 1,
0 ≤ x1 ≤ 2,
x2 ≥ 0.

(a) Transform the problem into a sequence of unconstrained optimization problems
with objective function Fr by using four penalty functions of the form as depicted
on slide 28, Section 3. (It is sufficient to use just one penalty parameter r here.)
(b) Explain why local minima of the unconstrained problems in part (a) must be global
minima for all r ≥ 0.
(c) Determine wether there will be a penalty multiplier r large enough such that the
unconstrained optimum of Fr is optimal for the original problem. Explain.

1

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller 1097434525U. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £7.16. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

85443 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£7.16
  • (0)
  Add to cart