Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 208

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint

Abrudan, Traian E., Eriksson, Jan, Koivunen, Visa · 2008 · IEEE Transactions on Signal Processing

Abstract

In many engineering applications we deal with constrained optimization problems with respect to complex-valued matrices. This paper proposes a Riemannian geometry approach for optimization of a real-valued cost function${\cal J}$of complex-valued matrix argument${\bf W}$, under the constraint that${\bf W}$is an$n \times n$unitary matrix. We derive steepest descent (SD) algorithms on the Lie group of unitary matrices$U(n)$. The proposed algorithms move towards the optimum along the geodesics, but other alternatives are also considered. We also address the computational complexity and the numerical stability issues considering both the geodesic and the nongeodesic SD algorithms. Armijo step sizeadaptation rule is used similarly to, but with reduced complexity. The theoretical results are validated by computer simulations. The proposed algorithms are applied to blind source separation in MIMO systems by using the joint diagonalization approach. We show that the proposed algorithms outperform other widely used algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2007.908999

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 208

Metadata

Authors
Abrudan, T. E., Eriksson, J., & Koivunen, V.
Venue
IEEE Transactions on Signal Processing
Published
2008-03
Volume
56
Issue
3
Pages
1134-1147
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2111136894
Cited by
208
References
1
FWCI
9.14
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint. https://app.cochat.ai/papers/10.1109/tsp.2007.908999
The paper
Abrudan, T. E., Eriksson, J., & Koivunen, V. (2008). Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2007.908999

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.