A feasible method for optimization with orthogonality constraints
From MaRDI portal
(Redirected from Publication:101635)
Recommendations
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Accelerated optimization with orthogonality constraints
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
Cites work
- scientific article; zbMATH DE number 4150052 (Why is no real title available?)
- scientific article; zbMATH DE number 1324524 (Why is no real title available?)
- scientific article; zbMATH DE number 681023 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Spectral Bundle Method for Semidefinite Programming
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- A majorization algorithm for constrained correlation matrix approximation
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- An augmented Lagrangian approach for sparse principal component analysis
- An implicit trust-region method on Riemannian manifolds
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Analysis of a quadratic programming decomposition algorithm
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure
- Efficient rank reduction of correlation matrices
- Inexact restoration method for minimization problems arising in electronic structure calculations
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- Line search algorithms with guaranteed sufficient decrease
- Matrix Analysis
- Molecular simulation and related topics: some open mathematical problems
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- Numerical Methods forp-Harmonic Flows and Applications to Image Processing
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the rank of a cograph
- Optimization Techniques on Riemannian Manifolds
- Optimization theory and methods. Nonlinear programming
- Practical methods of optimization.
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- QAPLIB - a quadratic assignment problem library
- Rank reduction of correlation matrices by majorization
- Recent Developments in the Modeling, Analysis, and Numerics of Ferromagnetism
- Regularization methods for semidefinite programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- The Geometry of Algorithms with Orthogonality Constraints
- The Newton iteration on Lie groups
- The University of Florida sparse matrix collection
- Trace optimization and eigenproblems in dimension reduction methods.
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Trust-region methods on Riemannian manifolds
- Two-Point Step Size Gradient Methods
Cited in
(only showing first 100 items - show all)- Statistical inference for extreme extremile in heavy-tailed heteroscedastic regression model
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Model-Based Tensor Low-Rank Clustering
- Gradient flow based Kohn-Sham density functional theory model
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- On the generalized essential matrix correction: an efficient solution to the problem and its applications
- Model-based clustering with envelopes
- Compressive sensing adaptation for polynomial chaos expansions
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Improved row-by-row method for binary quadratic optimization problems
- Riemannian quantum circuit optimization for Hamiltonian simulation
- Variational Rician noise removal via splitting on spheres
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- On the branch and bound algorithm for the extended trust-region subproblem
- Crowdsourcing Utilizing Subgroup Structure of Latent Factor Modeling
- Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography
- Numerical methods for Kohn–Sham density functional theory
- A feasible method for general convex low-rank SDP problems
- Reducing uncertainty of dynamic heterogeneous information networks: a fusing reconstructing approach
- Variational Bayesian strategies for high-dimensional, stochastic design problems
- \(p\)-almost Hadamard matrices and \(\lambda\)-planes
- Finding the global optimum of a class of quartic minimization problem
- Structured low-rank approximation: optimization on matrix manifold approach
- A block coordinate descent method for sensor network localization
- Multilevel Artificial Neural Network Training for Spatially Correlated Learning
- Minimal \(\sigma\)-field for flexible sufficient dimension reduction
- Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds
- Reducing subspace models for large‐scale covariance regression
- Sparse exploratory factor analysis
- A Riemannian Newton algorithm for nonlinear eigenvalue problems
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- A semi-orthogonal nonnegative matrix tri-factorization algorithm for overlapping community detection
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- Functional PCA With Covariate-Dependent Mean and Covariance Structure
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- Triangulated surface denoising using high order regularization with dynamic weights
- Cayley transform on Stiefel manifolds
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- A collection of efficient retractions for the symplectic Stiefel manifold
- Global convergence of ADMM in nonconvex nonsmooth optimization
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- Solving the discrete Euler-Arnold equations for the generalized rigid body motion
- Riemannian optimization methods for the truncated Takagi factorization
- Randomized algorithms for orthogonal nonnegative matrix factorization
- Computing extreme eigenvalues of large scale Hankel tensors
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Geometric inexact Newton method for generalized singular values of Grassmann matrix pair
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- The maximum separation subspace in sufficient dimension reduction with categorical response
- Continuous relaxations for the traveling salesman problem
- A variational framework for computing Wannier functions using dictionary learning
- Conditional variance estimator for sufficient dimension reduction
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- Riemannian conjugate gradient methods with inverse retraction
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
- A splitting method for orthogonality constrained problems
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
- Slow and finite-time relaxations to \(m\)-bipartite consensus on the Stiefel manifold
- On some p-almost Hadamard matrices
- Multiscale nonrigid point cloud registration using rotation-invariant sliced-Wasserstein distance via Laplace-Beltrami eigenmap
- Dimension reduction in time series under the presence of conditional heteroscedasticity
- A brief introduction to manifold optimization
- On some limitations of probabilistic models for dimension‐reduction: Illustration in the case of probabilistic formulations of partial least squares
- Distributed Estimation for Principal Component Analysis: An Enlarged Eigenspace Analysis
- Efficient Integration of Sufficient Dimension Reduction and Prediction in Discriminant Analysis
- Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- Hermite interpolation and data processing errors on Riemannian matrix manifolds
- On matrix exponentials and their approximations related to optimization on the Stiefel manifold
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization
- Effective algorithms for solving trace minimization problem in multivariate statistics
- Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction
- Optimization on flag manifolds
- Adaptive quadratically regularized Newton method for Riemannian optimization
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Nonmonotone local minimax methods for finding multiple saddle points
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
- Envelopes and principal component regression
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- rstiefel
- \(H_2\) model reduction for negative imaginary systems
- orthoDr
- A trust-region method for solving truncated complex singular value decomposition
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- Multiple graphs clustering by gradient flow method
This page was built for publication: A feasible method for optimization with orthogonality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q101635)
