Optimization of objective function that's the product of unitary matrices

  • Thread starter bastpg
  • Start date
  • #1
2
0
Hi,
I work in NRM and need for some reason to optimize an objective function of the form ||M-M_target||^2 where M is the product of a large number (>100) 2D unitary complex matrices (Qi) and a vector (A), i.e. M=Q1*Q2*...*QN*A, and M_target is a constant complex vector. I can do it directly, like people have done so far, but the problem has so much structure to it that it seems something smarter could be done. Note that this optimization should be fast, so reducing computation time even a little bit (>10%) could be a big deal. Let me know if the pb seems familiar and you have some ideas about it...
Thanks,
Bastien
 

Answers and Replies

  • #2
14,778
12,175
I do not see shortcuts, as your M_target and A have nothing in common. You could at best use a faster algorithm for matrix multiplication, in this case the Strassen algorithm should save some time.
 
  • #3
RPinPA
Science Advisor
Homework Helper
571
319
What is constant and what is a variable here?
 
  • #4
WWGD
Science Advisor
Gold Member
5,496
3,965
Only thing I can think of is, since squaring is monotonic for non-negatives, just seek to maximize ||M-M_target|| without concern for the square if you want to maximize or minimize difference if you wish to minimize the full expression.
 

Related Threads on Optimization of objective function that's the product of unitary matrices

  • Last Post
Replies
6
Views
2K
Replies
1
Views
3K
Replies
24
Views
57K
Replies
1
Views
1K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
5
Views
3K
Replies
2
Views
3K
Replies
5
Views
1K
Top