MathOverflow is a question and answer site for professional mathematicians. 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 a convex optimization problem of finding a function Q(x,y) as below:

Minimize $\int{k(x,y)Q(x,y)dxdy}$ subject to a list of constraints which are not relevant to the question, so I'm skipping them. The function $k(x,y)$ is known and my aim is to find the form of $Q(x,y)$. I was thinking if I could represent this double integration as a matrix multiplication and I convexly minimize over the unknown matrix of $Q(i,j)$ values, then I can curve fit or do something from the values available. My question is how do I represent a double integral as a matrix multiplication? Say, the limits are (-10,10) for both variables' integration.

share|cite|improve this question
up vote 0 down vote accepted

Okay found it out myself. It could be done the following way: Compute $k(x,y)$ for each incrementation and make a matrix $K$ which contain the values of $k(x,y)$ all through the interval for specified x,y limits. $Q(x,y)$ becomes a matrix itself which is to the optimization variable. Now the objective is:

Minimize $\int\int k(x,y)Q(x,y) dx dy$ = minimize sum(sum(K.* Q)) where {.*} means scalar multiplication of the matrices. sum(sum()) simply adds all the values in the matrix, which is exactly the numerical integration result.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.