Least Squares With Multiple Quadratic Constraints

  • Thread starter WCMU101
  • Start date
  • #1
WCMU101
14
0
Problem:

A = n by m matrix
x = m by 1 vector
y = n by 1 vector

C = c by m matrix
E = e by m matrix

Alpha, gamma and theta are constants.

norm(Ax-y) = min

subject to:

norm(Cx) = alpha
norm(Ex) = gamma
transpose(Cx)*Ex = (alpha^2)*(gamma^2)*cos(theta)

I read a paper on how to do this with 1 quadratic constraint and I got that working, but I can't figure out how to do it with 3. Any advice? (Numerical methods are fine).

Nick.
 

Answers and Replies

  • #2
AlephZero
Science Advisor
Homework Helper
7,025
297
You can do this using Lagrange multipliers. See any optimisation textbook, or Google.

This will add 3 more equations and 3 more variables to the "standard" least squares equations. Note, the extended system of equations will be symmetric, but NOT positive definite, so be careful what library routine you use to solve them!
 

Suggested for: Least Squares With Multiple Quadratic Constraints

Replies
2
Views
260
  • Last Post
Replies
4
Views
464
  • Last Post
Replies
4
Views
463
  • Last Post
Replies
2
Views
479
  • Last Post
Replies
2
Views
900
  • Last Post
Replies
4
Views
600
Replies
4
Views
430
  • Last Post
Replies
3
Views
752
Replies
3
Views
1K
Replies
1
Views
398
Top