Skip to main content
Jules's user avatar
Jules's user avatar
Jules's user avatar
Jules
  • Member for 14 years, 7 months
  • Last seen more than a month ago
Loading…
awarded
comment
The Frechet derivative and Lagrange multipliers on Banach spaces
Thanks! The Calculus of Variations is exactly what I'm looking for. Do you recommend a particular document to learn about it? I found maths.ed.ac.uk/~jmf/Teaching/Lectures/CoV.pdf. Can you post your answer as an answer so that I can accept it?
comment
Approximating a probability distribution by a mixture
Can you give a little more information about the physical background of the problem? How can you mix even one $\int p(x)f(x)$? You seem to be mixing uncountably many things there?
comment
Approximating a probability distribution by a mixture
Perhaps Frechet derivatives on Banach spaces can help here. What you'd want to say is d{the L1 norm}/dp = 0, except that p is a function not a number. Frechet derivatives generalize taking derivatives to taking derivatives by functions. That is, if you have an operator H : (R -> R) -> R, you can find H'. The solution in this case would be the solution to H'(p) = 0. I believe that H'(p) = 0 will reduce to a differential equation for p.
revised
The Frechet derivative and Lagrange multipliers on Banach spaces
added 37 characters in body; added 22 characters in body; added 20 characters in body
Loading…
comment
The Frechet derivative and Lagrange multipliers on Banach spaces
Willie Wong, I rewrote the question using LaTeX.
revised
The Frechet derivative and Lagrange multipliers on Banach spaces
added 79 characters in body; deleted 19 characters in body; added 1 characters in body; added 13 characters in body
Loading…
revised
The Frechet derivative and Lagrange multipliers on Banach spaces
added 9 characters in body; deleted 1422 characters in body
Loading…
revised
Loading…
comment
The Frechet derivative and Lagrange multipliers on Banach spaces
Hmm yes you are right...how about the problem with the additional constraint f(0) = f(1) = 0?
Loading…
comment
non-linear mixed integer programming question
If you don't have a bound on t_i then the problem is trivial. You can get arbitrarily close by just making t_i huge and s small.
comment
non-linear mixed integer programming question
Perhaps you can search for s around maxCi/M, it seems that the total error can be reduced by roughly a factor of 3 versus just picking s=maxCi/M.
comment
non-linear mixed integer programming question
Correction: choose s round $max C_i/M$.
comment
non-linear mixed integer programming question
For a given s the problem is easy. We want to minimize $|t_i*s - C_i|$, so suppose we could solve it exactly: $t_i = C_i/s$. Now we have to try only 2 candidates per $t_i$: $min(M,floor(C_i/s))$ and $min(M,ceil(C_i/s))$. So for a given s we can solve the problem quickly. I did this for a sample input and plotted s versus the resulting error $\sum |t_i*s-C_i|$. The result i.imgur.com/zcKOW.png The error is very high if you choose s much to small or much too large. Choosing s around $max {t_i}/M$ seems to get good results, perhaps good enough for your purposes.
awarded
comment
Is this problem solvable in polynomial time?
That settles this question. Thanks!
accepted