Optimization problem
Consider the problem: min f(x) s.t. h(x) ≥ 0 where f (x) = $(x_{1} -1)^2 +2(x_{2}-2)^2$ and h(x) = $[1-(x_{1})^2 -(x_{2})^2,x_{1}+x_{2}]^T$ .
(a) Plot the contour of f(x) and the feasible set on one single figure, i.e., overlay the feasible set on the contour plot of f(x);
(b) Find a solution to the problem using the natural logarithmic barrier function, i.e., the barrier function is -$log(h_{1}(x))-log(h_{2}(x))$ . Use initialization vector [0.5 0.5]$^{T} $ and the initial penalty parameter equal to 1 and reduce it by $\frac{1}{2} $ in each iteration. Use a stopping threshold of 0.002;
(c) In a 2-D figure, plot the trajectory (i.e., the values connected by lines with arrows) of the computed solution vector as the number of iteration progresses.
Rhystic53
Answer
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
1 Attachment
Erdos
-
For the gradient descent method see: https://en.wikipedia.org/wiki/Gradient_descent
- answered
- 864 views
- $30.00
Related Questions
- Optimal Control - Calculus of Variations
- Double Integrals, polar coordinates, Stoke's theorem, and Flow line Questions
- Determine values of a,b and c so that f(0)=0 and f(8)=0 and f'(2)= 16
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- Find the domain of the function $f(x)=\frac{\ln (1-\sqrt{x})}{x^2-1}$
- Prove that $1+\frac{1}{\sqrt{2}}+\dots+\frac{1}{\sqrt{n}} \leq 2 \sqrt{n}-1$
- Why does $ \sum\limits_{n=1}^{\infty } 2^{2n} \times \frac{(n!)^2}{n(2n+1)(2n)!} =2 $ ?
- Extremal values/asymptotes
This sounds like a small optimization project. Your offered bounty is too low. I would also suggest to extend your deadline.
Dont think so, and changing the deadline would mean nothing
Is this a question for numerical analysis? It is not possible to compute the solution analytically, you should use methods like gradient descent algorithm to find the minimizer.
Do you need a code or just the algorithm?
code is preferable
That's too much work! I can write a phsodocode, if you want to implement the code yourself, and graph solutions with a computer on your own.
thats fine just answer every part of the problem
Part c) can not be answered without a code and computing the solutions. So can only answer parts a) and b) and provide a phsodocode.
I suppose thats good enough