MY-ASSIGNMENTEXPERT™可以为您提供sydney MATH3971 Convex Optimization凸优化课程的代写代考和辅导服务！
这是悉尼大学凸优化课程的代写成功案例。
MATH3971课程简介
The questions how to maximise your gain (or to minimise the cost) and how to determine the optimal strategy/policy are fundamental for an engineer, an economist, a doctor designing a cancer therapy, or a government planning some social policies. Many problems in mechanics, physics, neuroscience and biology can be formulated as optimistion problems. Therefore, optimisation theory is an indispensable tool for an applied mathematician. Optimisation theory has many diverse applications and requires a wide range of tools but there are only a few ideas underpinning all this diversity of methods and applications. This course will focus on two of them. We will learn how the concept of convexity and the concept of dynamic programming provide a unified approach to a large number of seemingly unrelated problems. By completing this unit you will learn how to formulate optimisation problems that arise in science, economics and engineering and to use the concepts of convexity and the dynamic programming principle to solve straight forward examples of such problems. You will also learn about important classes of optimisation problems arising in finance, economics, engineering and insurance.
Prerequisites
At the completion of this unit, you should be able to:
- LO1. analyse static optimisation problems with constraints
- LO2. formulate deterministic and stochastic dynamic optimisation problems, that arise in scientific and engineering applications, as mathematical problems
- LO3. understand the importance of convexity for optimisation problems, and use convexity to determine whether a solution to a given problem exists and is unique
- LO4. check if a certain controlled system is controllable, observable, stabilisable
- LO5. apply the Maximum Principle in order to solve real world control problems
- LO6. formulate the Hamilton-Jacobi-Bellman equation for solution of dynamic optimisation problems and solve them in special cases
- LO7. explain the derivations of key theoretical results and discuss the role of mathematical assumptions in these derivations
- LO8. use game theory to formulate optimisation problems with many competing players
- LO9. identify important solvable classes of optimisation problems arising in finance, economics, engineering and insurance and provide solutions.
MATH3971 Convex Optimization HELP（EXAM HELP， ONLINE TUTOR）
Let $C_1=\left{x \in \mathbb{R}^2 \mid x_1 \geq 0, x_2 \geq 0\right}$, and let $C_2=\left{x \in \mathbb{R}^2 \mid x_1 \leq 0, x_2 \leq 0\right}$. Find a hyperplane that separates $C_1$ and $C_2$.
Let $f: \mathbb{R}^n \rightarrow \mathbb{R}$ be a differentiable convex function. Show that
$$
(\nabla f(x)-\nabla f(y))^{\top}(x-y) \geq 0, \quad \forall x, y \in \operatorname{dom} f
$$
Let $x_k \in \mathbb{R}^n, k=1,2, \ldots, T$. Let $x=\left[x_1^{\top}, x_2^{\top}, \ldots, x_k^{\top}\right]^{\top} \in \mathbb{R}^{n T}$ where $f: \mathbb{R}^{n T} \rightarrow \mathbb{R}$. Let $f(x)=\sum_{k=1}^T x_k^{\top} Q_k x_k$, where each $Q_k$ is positive semi-definite. Then show that $f$ is a convex function.
Suppose that $g(x)$ is convex and $h(x)$ is concave. Suppose the domain of both functions is a closed, convex set $C$ such that both $g(x)$ and $h(x)$ are always positive. Prove that the function $f(x)=\frac{g(x)}{h(x)}$ is quasi-convex, i.e., all sub-level sets of $f$ are convex sets.
Determine whether the following functions $f_i: \mathbb{R}^2 \rightarrow \mathbb{R}$ are convex, concave or neither.
a. $f_1\left(x_1, x_2\right)=x_1 x_2$ with domain $x_1>0, x_2>0$.
b. $f_2\left(x_1, x_2\right)=-\frac{1}{x_1 x_2}$ with domain $x_1>0, x_2>0$.
c. $f_3\left(x_1, x_2\right)=\frac{x_1^2}{x_2}$ with domain $x_1 \in \mathbb{R}, x_2>0$.
d. $f_4\left(x_1, x_2\right)=x_1 \log \left(1+\frac{\beta x_2}{x_1}\right)$ with domain $x_1, x_2>0$, and $\beta \in \mathbb{R}$ is a constant.
e. $f_5(x)=-\left(\sum_{i=1}^n x_i^a\right)^{1 / a}$ for $a \in(0,1)$.
f. $f_6(x)=\min \left(0.5, x, x^2\right)$.
g. $f_7(x)=\max {i \in{1,2, \ldots, n}} x_i-\min {i \in{1,2, \ldots, n}} x_i$.
MY-ASSIGNMENTEXPERT™可以为您提供SYDNEY MATH3971 CONVEX OPTIMIZATION凸优化课程的代写代考和辅导服务！
