A feasible method for optimization with orthogonality constraints
From MaRDI portal
Publication:101635
DOI10.1007/S10107-012-0584-1zbMATH Open1281.49030OpenAlexW2086953401MaRDI QIDQ101635FDOQ101635
Authors: Zaiwen Wen, Wotao Yin, Wotao Yin, Zaiwen Wen 
Publication date: 29 August 2012
Published in: Mathematical Programming, Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/102167
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
Cayley transformationcurvilinear searchinvariant subspacemaxcut SDPnearest correlation matrixorthogonality constraintpolynomial optimizationquadratic assignment problemspherical constraintStiefel manifold
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Semidefinite programming (90C22)
Cites Work
- QAPLIB - a quadratic assignment problem library
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- The University of Florida sparse matrix collection
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Trust-region methods on Riemannian manifolds
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- The Newton iteration on Lie groups
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Optimization theory and methods. Nonlinear programming
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- Practical methods of optimization.
- Trace optimization and eigenproblems in dimension reduction methods.
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Analysis of a quadratic programming decomposition algorithm
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- Recent Developments in the Modeling, Analysis, and Numerics of Ferromagnetism
- Title not available (Why is that?)
- Molecular simulation and related topics: some open mathematical problems
- An implicit trust-region method on Riemannian manifolds
- Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- Two-Point Step Size Gradient Methods
- Inexact restoration method for minimization problems arising in electronic structure calculations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization Techniques on Riemannian Manifolds
- Line search algorithms with guaranteed sufficient decrease
- A Spectral Bundle Method for Semidefinite Programming
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Rank reduction of correlation matrices by majorization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Numerical Methods forp-Harmonic Flows and Applications to Image Processing
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Regularization methods for semidefinite programming
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- An augmented Lagrangian approach for sparse principal component analysis
- A majorization algorithm for constrained correlation matrix approximation
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Efficient rank reduction of correlation matrices
- On the rank of a cograph
Cited In (only showing first 100 items - show all)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Model-based clustering with envelopes
- Compressive sensing adaptation for polynomial chaos expansions
- Improved row-by-row method for binary quadratic optimization problems
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography
- Numerical methods for Kohn–Sham density functional theory
- Reducing subspace models for large‐scale covariance regression
- Variational Bayesian strategies for high-dimensional, stochastic design problems
- Sparse exploratory factor analysis
- A Riemannian Newton algorithm for nonlinear eigenvalue problems
- Triangulated surface denoising using high order regularization with dynamic weights
- Cayley transform on Stiefel manifolds
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Computing extreme eigenvalues of large scale Hankel tensors
- The maximum separation subspace in sufficient dimension reduction with categorical response
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Continuous relaxations for the traveling salesman problem
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- A splitting method for orthogonality constrained problems
- On some limitations of probabilistic models for dimension‐reduction: Illustration in the case of probabilistic formulations of partial least squares
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- On matrix exponentials and their approximations related to optimization on the Stiefel manifold
- Adaptive quadratically regularized Newton method for Riemannian optimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- Multiple graphs clustering by gradient flow method
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A parallel orbital-updating based optimization method for electronic structure calculations
- A conjugate gradient method for electronic structure calculations
- rstiefel
- Interpretable domain adaptation via optimization over the Stiefel manifold
- Multiple partitions alignment via spectral rotation
- orthoDr
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds
- Recipes for sparse LDA of horizontal data
- Maximization of Matrix Trace Function of Product Stiefel Manifolds
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- Using negative curvature in solving nonlinear programs
- A derivative-free algorithm for spherically constrained optimization
- Simultaneous non-Gaussian component analysis (SING) for data integration in neuroimaging
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- Solving partial differential equations on manifolds from incomplete interpoint distance
- A feasible filter method for the nearest low-rank correlation matrix problem
- Parseval proximal neural networks
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures
- Accelerated optimization with orthogonality constraints
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- Emergent behaviors of high-dimensional Kuramoto models on Stiefel manifolds
- Transportless conjugate gradient for optimization on Stiefel manifold
- Gaussian processes with built-in dimensionality reduction: applications to high-dimensional uncertainty propagation
- Point-process models of social network interactions: Parameter estimation and missing data recovery
- Optimization problems with orthogonal matrix constraints
- Application of orthogonal transformations in the revised simplex method
- Reduced-rank multi-label classification
- A Riemannian subspace limited-memory SR1 trust region method
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- Multimodal, high-dimensional, model-based, Bayesian inverse problems with applications in biomechanics
- Topic Modeling on Triage Notes With Semiorthogonal Nonnegative Matrix Factorization
- Statistical inference for extreme extremile in heavy-tailed heteroscedastic regression model
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Gradient flow based Kohn-Sham density functional theory model
- 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
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- On the branch and bound algorithm for the extended trust-region subproblem
- Reducing uncertainty of dynamic heterogeneous information networks: a fusing reconstructing approach
- \(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
- Minimal \(\sigma\)-field for flexible sufficient dimension reduction
- Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- A variational framework for computing Wannier functions using dictionary learning
- Conditional variance estimator for sufficient dimension reduction
- Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
- Riemannian conjugate gradient methods with inverse retraction
- On some p-almost Hadamard matrices
- Multiscale nonrigid point cloud registration using rotation-invariant sliced-Wasserstein distance via Laplace-Beltrami eigenmap
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- A brief introduction to manifold optimization
- Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- Effective algorithms for solving trace minimization problem in multivariate statistics
- Optimization on flag manifolds
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- Optimal thermal actuation for mirror temperature control
Uses Software
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)
