Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Ya-xiang Yuan"'
Publikováno v:
SIAM Journal on Optimization; 2024, Vol. 34 Issue 2, p2150-2168, 19p
Autor:
Xiaoyu Wang1,2 wxy@lsec.cc.ac.cn, Ya-xiang Yuan3 yyx@lsec.cc.ac.cn
Publikováno v:
Journal of Computational Mathematics. 2022, Vol. 40 Issue 2, p295-336. 42p.
Publikováno v:
Mathematical Programming. 200:105-145
This paper considers polynomial optimization with unbounded sets. We give a homogenization formulation and propose a hierarchy of Moment-SOS relaxations to solve it. Under the assumptions that the feasible set is closed at infinity and the ideal of h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b440fd1487df9c8a102393dfa7db6a67
https://doi.org/10.1007/s10107-022-01878-5
https://doi.org/10.1007/s10107-022-01878-5
This paper studies generalized truncated moment problems with unbounded sets. First, we study geometric properties of the truncated moment cone and its dual cone of nonnegative polynomials. By the technique of homogenization, we give a convergent hie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b9ca8623ef4e849f71228aee658d38b
http://arxiv.org/abs/2208.00354
http://arxiv.org/abs/2208.00354
Publikováno v:
SIAM Journal on Optimization. 31:3097-3126
$\ell_{2,1}$ norm minimization with orthogonality constraints, which comprise a feasible region called the Stiefel manifold, has wide applications in statistics and data science. The state-of-the-a...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5389dc2bf98ac31fc53022862f238e9c
https://doi.org/10.1137/20m1354313
https://doi.org/10.1137/20m1354313
Autor:
Xiaoyu Wang1,2 WXY@LSEC.CC.AC.CN, Ya-xiang Yuan3 YYX@LSEC.CC.AC.CN
Publikováno v:
Journal of Machine Learning Research. 2023, Vol. 24, p1-49. 49p.
Publikováno v:
Optimization Methods and Software. 37:1205-1241
Updating the augmented Lagrangian multiplier by closed-form expression yields efficient first-order infeasible approach for optimization problems with orthogonality constraints. Hence, parallelizat...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cbcd28e9a7e36763d3ac1a9421930ae
https://doi.org/10.1080/10556788.2020.1852236
https://doi.org/10.1080/10556788.2020.1852236
Publikováno v:
IMA Journal of Numerical Analysis. 41:2488-2515
Quadratically constrained quadratic programming (QCQP) appears widely in engineering applications such as wireless communications and networking and multiuser detection with examples like the MAXCUT problem and boolean optimization. A general QCQP pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8222631ce4da59f4cd935b03a0031702
https://doi.org/10.1093/imanum/draa031
https://doi.org/10.1093/imanum/draa031
Publikováno v:
SIAM Journal on Scientific Computing. 42:A1686-A1713
In this paper, we study fixed-point schemes with certain low-rank structures arising from matrix optimization problems. Traditional first-order methods depend on the eigenvalue decomposition at eac...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37d07c50f747573eec42080b47b5a698
https://doi.org/10.1137/19m1259444
https://doi.org/10.1137/19m1259444