Optimization algorithms exploiting unitary constraints
From MaRDI portal
Cited in
(69)- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Parseval wavelets on hierarchical graphs
- Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem
- Lie-group-type neural system learning by manifold retractions
- A dimension reduction based approach for estimation and variable selection in partially linear single-index models with high-dimensional covariates
- Maximum likelihood estimation of nonnegative trigonometric sum models using a Newton-like algorithm on manifolds
- Projected nonmonotone search methods for optimization with orthogonality constraints
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Spectral residual method for nonlinear equations on Riemannian manifolds
- Variational Bayes on manifolds
- 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
- Optimization on matrix manifold based on gradient information and its applications in network control
- Transportless conjugate gradient for optimization on Stiefel manifold
- On the generalized essential matrix correction: an efficient solution to the problem and its applications
- 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
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Grassmann algorithms for low rank approximation of matrices with missing values
- Newton-type methods on Riemannian manifolds under Kantorovich-type conditions
- Cholesky QR-based retraction on the generalized Stiefel manifold
- 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
- A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds
- 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
- Riemannian preconditioning
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- Principal components: a descent algorithm
- Comparison of Two Main Approaches to Joint SVD
- On the consistency of coordinate-independent sparse estimation with BIC
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A splitting method for orthogonality constrained problems
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- Optimization methods on Riemannian manifolds via extremum seeking algorithms
- Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
- Constraint optimization and SU(N) quantum control landscapes
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- A class of smooth exact penalty function methods for 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
- scientific article; zbMATH DE number 7299944 (Why is no real title available?)
- A Riemannian Newton algorithm for nonlinear eigenvalue problems
- Point-Process Principal Components Analysis via Geometric Optimization
- Computing eigenspaces with low rank constraints
- Orientation estimation of cryo-EM images using projected gradient descent method
- Deep matrix factorization with knowledge transfer for lifelong clustering and semi-supervised clustering
- 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
- Linear Programming on the Stiefel Manifold
- Coordinate-independent sparse sufficient dimension reduction and variable selection
- Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: a geometric method
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- A sparse dimension-reduced subspace-based approach for detecting multiple change points in high-dimensional data
- Interpolation-based parametric reduced-order models with dynamic mode decomposition
- A randomized feasible algorithm for optimization with orthogonal constraints
- Multipliers correction methods for optimization problems over the Stiefel manifold
- Solving weighted orthogonal Procrustes problems via a projected gradient method
- Parallel implementations of Riemannian conjugate gradient methods for joint approximate diagonalization
- Numerical range of real-valued linear mapping on the complex Stiefel manifold: convexity and application
- A non-monotone adaptive scaled gradient projection method for orthogonality constrained problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- An adaptive constraint method for paraunitary filter banks with applications to spatiotemporal subspace tracking
- Nonconcave utility maximisation in the MIMO broadcast channel
- Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity
This page was built for publication: Optimization algorithms exploiting unitary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353610)
