Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
From MaRDI portal
Cited in
(43)- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Learning rotations with little regret
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- An alternate gradient method for optimization problems with orthogonality constraints
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- Transportless conjugate gradient for optimization on Stiefel manifold
- Effective algorithms for solving trace minimization problem in multivariate statistics
- 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
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- 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
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- 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
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising
- 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
- 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
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Close-to-optimal counter histogram-based forensics using mean structural similarity index metric
- A computationally efficient Lie group optimization algorithm for independent component analysis with Schur-toral decomposition and its application to image restoring
- A randomized feasible algorithm for optimization with orthogonal constraints
- Multipliers correction methods for optimization problems over the Stiefel manifold
- An LQR-Lagrange algorithm generated by interdisciplinary integration with optimal control and optimization
- A generalized complex power iteration-based algorithm for quartic-quadratic optimization problems over a spherical constraint and its applications
- A semidefinite relaxation for sums of heterogeneous quadratic forms on the Stiefel manifold
- A sparse optimization approach for simultaneous orthogonal tensor diagonalization
- Solving optimization problems over the Stiefel manifold by smooth exact penalty functions
- Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation
- A non-monotone adaptive scaled gradient projection method for orthogonality constrained problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
This page was built for publication: Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567727)
