0
votes
0answers
27 views

Union of all sets of optimal solutions to a perturbed linear programming problem

Please let me know if you have some ideas on how to approach this proof? I got stuck part-way through. The following linear program is a function of $\theta$, $ \begin{array}{ll} \min & c^\top x ...
2
votes
1answer
54 views

Got stuck with this $L^2(-1, 1)$ optimization problem. Any ideas where it comes from?

Statement Let $u(x) \in L^2(-1, 1)$. Solve the following optimization problem: $$ \begin{cases} J(u) = 4 \int_{-1}^{1} \sqrt{|x| (1 - |x|)} u(x) dx + \left(\int_{-1}^1 \sin(3\pi x) u(x) dx\right)^2 ...
1
vote
0answers
22 views

Interpreting constraints in an optimization problem

I am working on an optimization-based image denoising project in which I have three "flavors" of an optimization problem, one constrained and two unconstrained. They are given as follows: ...
0
votes
1answer
27 views

Convex Subset Projection

Suppose that C is a closed convex subset of $\mathbb R^n$ and $x \in \mathbb R^n$. The projection of $\mathbf x$ onto C is the closest point $\mathbf y \in C : \mathbf z = \mathbf y$ minimizes ...
0
votes
0answers
56 views

max and min values on symmetric polytope

Let $-N\leq t \leq N$. Let $A$ be regular $(N-1)$-dimensional simplex with vertices $(t,0, \ldots, 0)\ldots (0, 0,\ldots, t)$ and $B$ be regular $(N-1)$-dimensional simplex with vertices $(t-N+1,1, ...
0
votes
0answers
25 views

Convex cones and positively homogenous and subadditive functional

Let $V$ be a linear topological space, $K \subsetneq V$ a convex, closed cone with $0 \in K$ and $k \in K \setminus (-K)$. Show that the functional $\varphi : V \to \mathbb R \cup \{ \pm \infty \}$ ...
1
vote
1answer
38 views

Convex Sets and extreme supports

Let the set $S$ in $R^n$ consists of the origin $0$ and $n$ lineary independent vectors $T_1, \ldots, T_n$. Show that $C(S)$, the convex hull of of $S$, is the intersection of its extreme supports, ...
1
vote
2answers
62 views

Hessian matrix and epigraphs

I'm working on a homework assignment concerning convex optimization and I came across a problem involving the convexity of the function and the convexity of the domain of the function. Consider the ...
3
votes
1answer
265 views

Solving optimization problems using derivatives and critical points

I have a homework question which I have completed 2/3 of; however I am stuck on the last part of the question. The question is: A drug used to treat cancer is effective at low doses with an ...
0
votes
0answers
18 views

Homework: compare two complex functions' local maximizers

Suppose $F_i,i=1,2$ and $Q$ are independent CDF with support on $[0,\infty)$, let $\bar F_i=1-F_i$ and $\bar Q=1-Q$, define $$\Psi_1(u) =-c\int_0^u\bar F_1(z)dz+\bigg[1-\frac{C-c}{\bar ...
0
votes
1answer
50 views

Strict local minimiser

Let $\Omega$ be a convex subset of $R^n$ adm f is a real valued, twice differentiable function. Let $x^*$ to be a point in $\Omega$ and suppose that there exists $c \in R \, c >0$ s.t. for all ...
1
vote
0answers
81 views

Formulation of a problem as semidefinite programming

I would appreciate some help with this problem: $R$ is a positive semidefinite matrix $\in{R}^{n\times n}$, $A \in{R}^{n\times m}$. I need to formulate this optimization problem as semidefinite ...
1
vote
1answer
318 views

How to prove this function is quasi-convex/concave?

this is the function: $$\displaystyle f(a,b) = \frac{b^2}{4(1+a)}$$
0
votes
1answer
61 views

Projection: two closed convex sets

I am really struggling with this problem: $C$ and $D$ are closed, convex subsets of ${R}^n$ with non-empty intersection, i.e. $C \cap D \neq \emptyset $ . Is it true that projection $p_{C\cap ...
3
votes
1answer
580 views

Why is this composition of concave and convex functions concave?

Please forgive my ignorance. I have a quick silly question about a statement given without proof in Convex Optimization by Boyd and Vandenberghe (page 87). Suppose $\mathbb{R}_+^n$ is the set of ...
2
votes
1answer
88 views

Approximating a function with a convex function

Let $f:\mathbb{R} \rightarrow \mathbb{R}$ be a continuous, differentiable function. Is there a known algorithm that fits $f$ with $g$, which is an order-$n$ polynomial that is convex, in the least ...
1
vote
0answers
242 views

Linear programming: writing a problem with artificial variables?

Use artificial variables to write a linear programming problem in canonical form with non-negative resource vector whose solution will determine whether there exists (and if so, find) non-negative ...
2
votes
0answers
59 views

Prove that $\text{int}(\text{dom}(f))$ is a convex set.

Let $f$ be a convex function. I have to prove that $\text{int}(\text{dom}(f))$ is a convex set. (Be careful with $-∞$ )
2
votes
0answers
212 views

sufficient condition for KKT problems

For the Karush-Kuhn Tucker optimsation problem, Wikipedia notes that: "The necessary conditions are sufficient for optimality if the objective function f and the inequality constraints g_j are ...
0
votes
0answers
98 views

Iterative scheme for a nonlinear optimization problem

Let $\mathbb{PD}_3 \subset \mathbb{R}^{3 \times 3}$ be the set of the positive-definite $3 \times 3$ real matrices. For given $v \in \mathbb{R}^{3 \times 1}$, consider the function $f_v: ...
4
votes
1answer
5k views

Degeneracy in Linear Programming

Consider the standard form polyhedron, and assume that the rows of the matrix A are linearly independent. $$ \left \{ x | Ax = b, x \geq 0 \right \} $$ (a) Suppose that two different bases lead to ...
1
vote
2answers
101 views

Counterexample to show that the set of global minima of a function $f$ is a strict subset of the set of minima of the convex envelope of $f$

Let $f_C$ be the convex envelope of $f$ on a non-empty convex set $C \subset \mathbb{R}^n$ I need to show that $\{ x^∗ \in C : f(x^∗) \leq f(x), \forall x \in C \} \subset \{x^∗ \in C : f_C(x^∗) \leq ...