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

If you have a problem in convex optimization where all $N$ constraints ($N >> 0$) yield no possible solution but you are able to rank, or weight the constraint in terms of their importance are there methods I can look into for approximate solutions which violate constraints minimally (by some, say, squared metric) taking into account the priorities?

share|cite|improve this question
1  
As a first Idea I would suggest to combine the Penalty method with weights for each constraint? en.wikipedia.org/wiki/Penalty_method – k1next Jan 10 '13 at 20:12

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.