A feasible method for optimization with orthogonality constraints

Minimization with orthogonality constraints (e.g., ) and/or spherical constraints (e.g., ) has wide applications in polynomial optimization, combinatorial optimization, eigenvalue problems, sparse PCA, p-harmonic flows, 1-bit compressive sensing, matrix rank minimization, etc. These problems are dif...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 142; no. 1-2; pp. 397 - 434
Main Authors:	Wen, Zaiwen, Yin, Wotao
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2013 Springer Nature B.V
Subjects:	Algorithms Analysis Applied mathematics Assignment problem Calculus of Variations and Optimal Control; Optimization Combinatorics Eigenvalues Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Partial differential equations Polynomials Studies Theoretical Topological manifolds Nearest correlation matrix Invariant subspace 65K05 Curvilinear search Maxcut SDP 90C26 Eigenvalue and eigenvector Quadratic assignment problem 90C27 Orthogonality constraint Cayley transformation 90C30 Polynomial optimization Stiefel manifold 90C22 Spherical constraint 49Q99
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!