Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
From MaRDI portal
Publication:4567727
DOI10.1109/TSP.2007.908999zbMath1390.90510OpenAlexW2111136894MaRDI QIDQ4567727
Traian Abrudan, Visa Koivunen, Jan R. Eriksson
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2007.908999
Related Items (30)
Constraint optimization and SU(N) quantum control landscapes ⋮ A class of smooth exact penalty function methods for optimization problems with orthogonality constraints ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ Implicit steepest descent algorithm for optimization with orthogonality constraints ⋮ Transportless conjugate gradient for optimization on Stiefel manifold ⋮ Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ A global neural network learning machine: coupled integer and fractional calculus operator with an adaptive learning scheme ⋮ Learning rotations with little regret ⋮ Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices ⋮ Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ Quantifying measurement-induced disturbance to distinguish correlations as classical or quantum ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Effective algorithms for solving trace minimization problem in multivariate statistics ⋮ Generalized left-localized Cayley parametrization for optimization with orthogonality constraints ⋮ A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ On the generalized essential matrix correction: an efficient solution to the problem and its applications ⋮ Solving the discrete Euler-Arnold equations for the generalized rigid body motion ⋮ Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ An alternate gradient method for optimization problems with orthogonality constraints ⋮ Conjugate gradient algorithm for optimization under unitary matrix constraint ⋮ Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint ⋮ Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
This page was built for publication: Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
