Constraint programming is a particular form of optimization modeling that tends to be well-suited for combinatorial models like scheduling and planning.
Questions tagged [constraint-programming]
161 questions
1
vote
0 answers
How to prove $-\ln(1-\|x\|^2)$ is self-concordant function?
I'm trying to prove $-\ln(1-\|x\|^2_2)$ is self-concordant function.
I think 1-dim case is easy to prove, but I cannot prove multi-dim cases. It's really hard to use definition because heavy Hessian. Can anyone help me with that? Thank you!
anyone
- 31
1
vote
1 answer
What transformation should be used in an optimization problem with constraints?
We have an optimization problem $\max_x f(x)$.
We have a procedure that computes an approximate solution $x$.
The procedure assumes that $x$ is not constrained. In this case, $x \in [-1,1]$.
Therefore, we can run the procedure on the function…
Imean H
- 211
- 1
- 4