Optimization algorithms exploiting unitary constraints
From MaRDI portal
Publication:5353610
DOI10.1109/78.984753zbMath1369.90169OpenAlexW2156529323MaRDI QIDQ5353610
Publication date: 8 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/78.984753
Related Items (60)
Orientation estimation of cryo-EM images using projected gradient descent method ⋮ Constraint optimization and SU(N) quantum control landscapes ⋮ An adaptive constraint method for paraunitary filter banks with applications to spatiotemporal subspace tracking ⋮ Grassmann algorithms for low rank approximation of matrices with missing values ⋮ A class of smooth exact penalty function methods for optimization problems with orthogonality constraints ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Optimization on matrix manifold based on gradient information and its applications in network control ⋮ An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints ⋮ Geometric Inexact Newton Method for Generalized Singular Values of Grassmann Matrix Pair ⋮ Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Principal components: a descent algorithm ⋮ Newton-type methods on Riemannian manifolds under Kantorovich-type conditions ⋮ Point-Process Principal Components Analysis via Geometric Optimization ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds ⋮ Implicit steepest descent algorithm for optimization with orthogonality constraints ⋮ Transportless conjugate gradient for optimization on Stiefel manifold ⋮ Lie-group-type neural system learning by manifold retractions ⋮ Cholesky QR-based retraction on the generalized Stiefel manifold ⋮ Coordinate-independent sparse sufficient dimension reduction and variable selection ⋮ Deep matrix factorization with knowledge transfer for lifelong clustering and semi-supervised clustering ⋮ Parseval wavelets on hierarchical graphs ⋮ Operator-valued formulas for Riemannian gradient and Hessian and families of tractable metrics in Riemannian optimization ⋮ The condition number of singular subspaces, revisited ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints ⋮ Linear Programming on the Stiefel Manifold ⋮ A dimension reduction based approach for estimation and variable selection in partially linear single-index models with high-dimensional covariates ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ Maximum likelihood estimation of nonnegative trigonometric sum models using a Newton-like algorithm on manifolds ⋮ On the consistency of coordinate-independent sparse estimation with BIC ⋮ On the generalized essential matrix correction: an efficient solution to the problem and its applications ⋮ A splitting method for orthogonality constrained problems ⋮ A non-monotone linear search algorithm with mixed direction on Stiefel manifold ⋮ A modified optimization method for robust partial quadratic eigenvalue assignment using receptances and system matrices ⋮ Solving the discrete Euler-Arnold equations for the generalized rigid body motion ⋮ Projected nonmonotone search methods for optimization with orthogonality constraints ⋮ Nonconcave utility maximisation in the MIMO broadcast channel ⋮ First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds ⋮ Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity ⋮ Design and analysis of linear precoders under a mean square error criterion. I: foundations and worst case designs ⋮ Design and analysis of linear precoders under a mean square error criterion. II: MMSE designs and conclusions ⋮ Riemannian Preconditioning ⋮ Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem ⋮ Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization ⋮ Comparison of Two Main Approaches to Joint SVD ⋮ A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds ⋮ Optimization Methods on Riemannian Manifolds via Extremum Seeking Algorithms ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ Spectral residual method for nonlinear equations on Riemannian manifolds ⋮ Variational Bayes on manifolds ⋮ Conjugate gradient algorithm for optimization under unitary matrix constraint ⋮ Unnamed Item ⋮ Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods ⋮ Computing Eigenspaces With Low Rank Constraints ⋮ A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems ⋮ An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint ⋮ Active channel sparsification: realizing frequency-division duplexing massive MIMO with minimal overhead ⋮ Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
This page was built for publication: Optimization algorithms exploiting unitary constraints
