Hi,(adsbygoogle = window.adsbygoogle || []).push({});

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

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

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

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Optimization objective function |
---|

A Infinite matrices and the Trace function |

I How to find admissible functions for a domain? |

I Is there a geometric interpretation of orthogonal functions? |

I Linear Program:Multiple Optima for multivariable Obj. Func.? |

**Physics Forums | Science Articles, Homework Help, Discussion**