Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
261 views

When is the optimum of an optimization problem affine in the constraint parameter?

While working on a variational problem I have reached to the following question: Let $f:(0,\infty) \to [0,\infty)$ be a $C^1$ function satisfying $f(1)=0$. Suppose that $f(x)$ is strictly increasing ...
Asaf Shachar's user avatar
  • 6,741
1 vote
0 answers
232 views

Semi-convex problem and almost convex problem

I have a target function, I've computed its Hessian to check convexity, it has a positive-definite sub-matrix and small negative-definite sub-matrix and a kernel. Sometimes it is even better -- the ...
Moonwalker's user avatar
1 vote
0 answers
100 views

Changing a nonlinear equality constraint into some conic inequality plus rank constraint

If we have a constraint optimization problem in which one of our constraint is $\prod\limits_{k = 1}^N {\left( {x - {a_k}} \right) = 0} $ . How could this nonlinear equality condition be changed into ...
Parsis's user avatar
  • 33