Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Jian L Zhou"'
Autor:
Wen P. Yu, Jing L. Ding, Xin L. Liu, Guo D. Zhu, Feng Lin, Jian J. Xu, Ziyao Wang, Jian L. Zhou
Publikováno v:
Immunity, Inflammation and Disease, Vol 9, Iss 3, Pp 746-757 (2021)
Abstract Titanium has been widely used in prosthetic valves, but they are associated with serious defects in titanium‐based prosthetic valves, such as thrombosis, calcification, and decay. Therefore, it is very important to biofunctionalize titaniu
Externí odkaz:
https://doaj.org/article/991bc7317b8a4b80a305a3edff754742
Publikováno v:
Immunity, Inflammation and Disease
Immunity, Inflammation and Disease, Vol 9, Iss 3, Pp 746-757 (2021)
Immunity, Inflammation and Disease, Vol 9, Iss 3, Pp 746-757 (2021)
Titanium has been widely used in prosthetic valves, but they are associated with serious defects in titanium‐based prosthetic valves, such as thrombosis, calcification, and decay. Therefore, it is very important to biofunctionalize titanium‐based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::867b6a900794d2df8cbd7a06599c1d54
https://doi.org/10.1002/iid3.429
https://doi.org/10.1002/iid3.429
Autor:
Jian L. Zhou, André L. Tits
Publikováno v:
SIAM Journal on Optimization. 6:461-487
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::113585318cef38dedb3e4e5e1ff71f31
https://doi.org/10.1137/0806025
https://doi.org/10.1137/0806025
Publikováno v:
SIAM Journal on Numerical Analysis. 29:1187-1202
When solving inequality constrained optimization problems via Sequential Quadratic Programming (SQP), it is potentially advantageous to generate iterates that all satisfy the constraints: all quadratic programs encountered are then feasible and there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43f67d721aea0a4246321039cac58fa7
https://doi.org/10.1137/0729072
https://doi.org/10.1137/0729072
Autor:
Jian L. Zhou, André L. Tits
Publikováno v:
Large Scale Optimization ISBN: 9781461336341
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based on an interior point iteration introduced more than ten years ago by J. Herskovits for the solution of nonlinear programming problems. Herskovits’ it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e03860639c8df4c790e07eaf80e0e1fe
https://doi.org/10.1007/978-1-4613-3632-7_20
https://doi.org/10.1007/978-1-4613-3632-7_20
Autor:
Jian L. Zhou, André L. Tits
Publikováno v:
SIAM Journal on Optimization. 8:284-285
An error is pointed out in the local convergence proof in the quoted paper [J. L. Zhou and A. L. Tits, SIAM J. Optim., 6 (1996), pp. 461--487]. A correct proof is given.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c548144079c66bb9a70546200d55c04
https://doi.org/10.1137/s1052623496313659
https://doi.org/10.1137/s1052623496313659
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.