Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Stephen A. Vavasis"'
Autor:
Stephen A. Vavasis, Xuan Vinh Doan
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030218027
WCGO
WCGO
We propose Ky Fan 2-k-norm-based models for the nonconvex low-rank matrix recovery problem. A general difference of convex algorithm (DCA) is developed to solve these models. Numerical results show that the proposed models achieve high recoverability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abe8ead5bd63585bfc2fa0f0597d0c65
https://doi.org/10.1007/978-3-030-21803-4_32
https://doi.org/10.1007/978-3-030-21803-4_32
Cohesive fracture is among the few techniques able to model complex fracture nucleation and propagation with a sharp (nonsmeared) representation of the crack. Implicit time-stepping schemes are often favored in mechanics due to their ability to take
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53cbb5007f085844479a95bde1c090fd
Autor:
Nicolas Gillis, Stephen A. Vavasis
Publikováno v:
SIAM Journal on Optimization. 25:677-698
Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing. This prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d7494a774b937bd2ec835cf06abbd59
https://doi.org/10.1137/130940670
https://doi.org/10.1137/130940670
Autor:
Stephen A. Vavasis, Nicolas Gillis
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 36:698-714
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns), which is equiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ed0242f4151a072ea5059073b2a77c6
https://doi.org/10.1109/tpami.2013.226
https://doi.org/10.1109/tpami.2013.226
Autor:
Stephen A. Vavasis, Xuan Vinh Doan
Publikováno v:
SIAM Journal on Optimization. 23:2502-2540
We propose a convex optimization formulation with the nuclear norm and $\ell_1$-norm to find a large approximately rank-one submatrix of a given nonnegative matrix. We develop optimality conditions for the formulation and characterize the properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::277407f9b25caca4853e173f731186a2
https://doi.org/10.1137/100814251
https://doi.org/10.1137/100814251
Publikováno v:
SIAM Journal on Scientific Computing. 35:A517-A540
We propose a proximal point algorithm to solve the LAROS problem, that is, the problem of finding a “large approximately rank-one submatrix.” This LAROS problem is used to sequentially extract features in data. We also develop new stopping criter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9b73d0c3b4fdb8f6bb9df0c756b76ad
https://doi.org/10.1137/110843381
https://doi.org/10.1137/110843381
Publikováno v:
Engineering with Computers. 30:315-329
The presence of a few inverted or poor-quality mesh elements can negatively affect the stability, convergence and efficiency of a finite element solver and the accuracy of the associated partial differential equation solution. We propose a mesh quali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c9bed3296a25478f72cf535ddd979b8
https://doi.org/10.1007/s00366-012-0294-6
https://doi.org/10.1007/s00366-012-0294-6
Autor:
Suzanne M. Shontz, Stephen A. Vavasis
Publikováno v:
Engineering with Computers. 28:135-147
Compressible Mooney-Rivlin theory has been used to model hyperelastic solids, such as rubber and porous polymers, and more recently for the modeling of soft tissues for biomedical tissues, undergoing large elastic deformations. We propose a solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f55d7afdb9970888e872df2af262a5c5
https://doi.org/10.1007/s00366-011-0225-y
https://doi.org/10.1007/s00366-011-0225-y
Autor:
Brendan P. W. Ames, Stephen A. Vavasis
Publikováno v:
Mathematical Programming. 129:69-89
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear norm. This t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::293dbb9c1ae0a3f659d145a104741e33
https://doi.org/10.1007/s10107-011-0459-x
https://doi.org/10.1007/s10107-011-0459-x
Publikováno v:
SIAM Journal on Numerical Analysis. 46:3264-3284
We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2260da56e17251d80904460ca708aba
https://doi.org/10.1137/040611781
https://doi.org/10.1137/040611781