Least Squares With Multiple Quadratic Constraints

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

Main Question or Discussion Point

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
6,994
291
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!
 

Related Threads on Least Squares With Multiple Quadratic Constraints

Replies
1
Views
1K
  • Last Post
Replies
3
Views
1K
Replies
2
Views
636
  • Last Post
Replies
5
Views
795
Replies
6
Views
8K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
7
Views
2K
  • Last Post
Replies
23
Views
13K
  • Last Post
Replies
2
Views
2K
Top