The architecture of this set of codes and the interaction among them is shown in Figure 1. The main testing code main code.m calls the code riemann grad unit opt.m that performs Riemannian optimization under unitary matrix constraint. Steepest Descent/Ascent (SD/SA) algorithm (see Table 3.2 in [1]), Conjugate Gradient (CG-PR, CG-FR) algo- rithms (both Fletcher-Reeves and Polak-Ribi`ere formulas, see Table 3.3 in [1]), are im- plemented. This code further calls the codes implementing line search methods: Armijo method geod search armijo.m, as well as the polynomial and DFT-based approximation

cf_eval.m
diag_crit_eval.m
euclid_grad_eval.m
geod_search_armijo.m
geod_search_dft.m
geod_search_poly.m
innerprod.m
license.txt
main_code.m
README.pdf
riemann_grad_unit_opt.m
skew.m
unit_crit_eval.m
unit_opt
........\cf_eval.m
........\diag_crit_eval.m
........\euclid_grad_eval.m
........\geod_search_armijo.m
........\geod_search_dft.m
........\geod_search_poly.m
........\innerprod.m
........\license.txt
........\main_code.m
........\README.pdf
........\riemann_grad_unit_opt.m
........\skew.m
........\unit_crit_eval.m

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．