The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Optimization algorithms exploiting unitary constraints
Abstract
This paper presents novel algorithms that iteratively converge to a local minimum of a real-valued function f (X) subject to the constraint that the columns of the complex-valued matrix X are mutually orthogonal and have unit norm. The algorithms are derived by reformulating the constrained optimization problem as an unconstrained one on a suitable manifold. This significantly reduces the dimensionality of the optimization problem. Pertinent features of the proposed framework are illustrated by using the framework to derive an algorithm for computing the eigenvector associated with either the largest or the smallest eigenvalue of a Hermitian matrix.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
A blind source separation technique using second-order statistics
Belouchrani, A., Abed-Meraim, K., Cardoso, J.-F., & Moulines, E. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.554307 · Cited by 2,775
Blind beamforming for non-gaussian signals
Cardoso, J. F., & Souloumiac, A. (1993) · IEE Proceedings F Radar and Signal Processing · doi:10.1049/ip-f-2.1993.0054 · Cited by 2,738
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
An Introduction to Differentiable Manifolds and Riemannian Geometry
(1975) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6065-9 · Cited by 1,778
Petersen, P. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-6434-5 · Cited by 1,289
Polak, E. (1997) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-0663-7 · Cited by 914
Cited by
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
On-Manifold Preintegration for Real-Time Visual--Inertial Odometry
Forster, C., Carlone, L., Dellaert, F., & Scaramuzza, D. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2597321 · Cited by 1,502
IMU Preintegration on Manifold for Efficient Visual-Inertial Maximum-a-Posteriori Estimation
Forster, C., Carlone, L., Dellaert, F., & Scaramuzza, D. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.006 · Cited by 499
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
Linear Dimensionality Reduction: Survey, Insights, and Generalizations
Cunningham, J. P., & Ghahramani, Z. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.0873 · Cited by 357
Metadata
- Authors
- Manton, J. H.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2002-03
- Volume
- 50
- Issue
- 3
- Pages
- 635-650
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2156529323
- Cited by
- 457
- References
- 23
- FWCI
- 14.80
- 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: Optimization algorithms exploiting unitary constraints. https://app.cochat.ai/papers/10.1109/78.984753
- The paper
- Manton, J. H. (2002). Optimization algorithms exploiting unitary constraints. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.984753
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.