{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:14:13Z","timestamp":1746245653655},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>This paper is concerned with the class of non-convex optimization problems with orthogonality constraints. We develop computationally efficient relaxations that transform non-convex orthogonality constrained problems into polynomial-time solvable surrogates. A novel penalization technique is used to enforce feasibility and derive certain conditions under which the constraints of the original non-convex problem are guaranteed to be satisfied. Moreover, we extend our approach to a feasibility-preserving sequential scheme that solves penalized relaxation to obtain near-globally optimal points. Experimental results on synthetic and real datasets demonstrate the effectiveness of the proposed approach on two practical applications in machine learning.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/183","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"1319-1326","source":"Crossref","is-referenced-by-count":2,"title":["Non-smooth Optimization over Stiefel Manifolds with Applications to Dimensionality Reduction and Graph Clustering"],"prefix":"10.24963","author":[{"given":"Fariba","family":"Zohrizadeh","sequence":"first","affiliation":[{"name":"The University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Kheirandishfard","sequence":"additional","affiliation":[{"name":"The University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Kamangar","sequence":"additional","affiliation":[{"name":"The University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramtin","family":"Madani","sequence":"additional","affiliation":[{"name":"The University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2019","name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","start":{"date-parts":[[2019,8,10]]},"theme":"Artificial Intelligence","location":"Macao, China","end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:47:24Z","timestamp":1564300044000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/183"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/183","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}