Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have this quadratic function $x'Ax$ which is not convex. I want to maximize this function subject to the constraints that the solution x lies in a simplex such that $\sum_{i=1}^{n}x_i=1$. That means the solution lies in a simplex and $x \epsilon [0,1]^n$.

I want to write an iterative procedure to do this. Suggestions?

share|cite|improve this question
    
Do you mean the objective is not concave? That's the kind of objective you want when you're maximizing. If so, I think this will be tricky. Any iterative procedure is likely to find a local maximum, not a global maximum. – Mike Spivey Dec 7 '12 at 18:46
    
yeah concave, I mean it's not concave. How should I proceed? – user34790 Dec 7 '12 at 19:24

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.