An exact penalty approach for optimization with nonnegative orthogonality constraints
Abstract Optimization with nonnegative orthogonality constraints has wide applications in machine learning and data sciences. It is NP-hard due to some combinatorial properties of the constraints. We first propose an equivalent optimization formulation with nonnegative and multiple sp...
Main Authors: | Jiang, Bo, Meng, Xiang, Wen, Zaiwen, Chen, Xiaojun |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2023
|
Online Access: | https://hdl.handle.net/1721.1/148140 |
Similar Items
-
Robust orthogonal nonnegative matrix tri-factorization for data representation
by: Peng, Siyuan, et al.
Published: (2022) -
Augmented Lagrangian and differentiable exact penalty methods
Published: (2002) -
Robust nonnegative matrix factorization with local coordinate constraint for image clustering
by: Peng, Siyuan, et al.
Published: (2021) -
Lower bounds on nonnegative rank via nonnegative nuclear norms
by: Fawzi, Hamza, et al.
Published: (2016) -
An Almost Optimal Algorithm for Computing Nonnegative Rank
by: Moitra, Ankur
Published: (2017)