A feasible method for optimization with orthogonality constraints
A feasible method for optimization with orthogonality constraints
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
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 difficult because the constraints are not only...
Alternative Titles
Full title
A feasible method for optimization with orthogonality constraints
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1475540063
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1475540063
Other Identifiers
ISSN
0025-5610
E-ISSN
1436-4646
DOI
10.1007/s10107-012-0584-1
