Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Positive-definite matrix completion"'
Autor:
Yamashita, Nobuo1 nobuo@i.kyoto-u.ac.jp
Publikováno v:
Mathematical Programming. Sep2008, Vol. 115 Issue 1, p1-30. 30p. 2 Charts, 5 Graphs.
Publikováno v:
In Parallel Computing 2006 32(1):24-43
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Yu-Hong Dai, Nobuo Yamashita
Publikováno v:
Journal of the Operations Research Society of China. 2:39-56
Based on the idea of maximum determinant positive definite matrix completion, Yamashita (Math Prog 115(1):1–30, 2008) proposed a new sparse quasi-Newton update, called MCQN, for unconstrained optimization problems with sparse Hessian structures. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c77edeeb93865e7a3af730129852a7be
https://doi.org/10.1007/s40305-014-0039-x
https://doi.org/10.1007/s40305-014-0039-x
Autor:
Nobuo Yamashita, Yu-Hong Dai
Publikováno v:
Numerical Algebra, Control & Optimization. 1:61-69
In this paper, we briefly review the extensions of quasi-Newton methods for large-scale optimization. Specially, based on the idea of maximum determinant positive definite matrix completion, Yamashita (2008) proposed a new sparse quasi-Newton update,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13a6f093ece595e7273356232bf1d169
https://doi.org/10.3934/naco.2011.1.61
https://doi.org/10.3934/naco.2011.1.61
Autor:
Nobuo Yamashita
Publikováno v:
Mathematical Programming. 115:1-30
Quasi-Newton methods are powerful techniques for solving unconstrained minimization problems. Variable metric methods, which include the BFGS and DFP methods, generate dense positive definite approximations and, therefore, are not applicable to large
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::073552de181cc6e77ac07007d49af5d0
https://doi.org/10.1007/s10107-007-0137-1
https://doi.org/10.1007/s10107-007-0137-1
Autor:
E. M. Klem
Publikováno v:
Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie. 34
The positive definite matrix completion problem. This study considers under which conditions a partial Hermitian matrix admits a positive definite completion. The answer is closely related to the underlying graph of the matrix. It turns out that if t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f54e0cf638c6cb1a5c67933be4049648
https://doi.org/10.4102/satnt.v34i1.1322
https://doi.org/10.4102/satnt.v34i1.1322
Publikováno v:
Parallel Computing. 32:24-43
A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it featur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfa05c82ed5873fd8aae1f7522eede6e
https://doi.org/10.1016/j.parco.2005.07.002
https://doi.org/10.1016/j.parco.2005.07.002