Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Jin-He WANG"'
Autor:
Zhen Zhang1,2, Jin-he Wang2, Zheng-kun Li3, Hua-meng Fu2 hmfu@imr.ac.cn, Hong Li3, Zheng-wang Zhu3, Hai-feng Zhang2,3
Publikováno v:
China Foundry. Nov2024, Vol. 21 Issue 6, p659-666. 8p.
Autor:
Zhen Zhang, Lin-na Feng, Jin-he Wang, Zheng-kun Li, Hua-meng Fu, Hong Li, Zheng-wang Zhu, Hai-feng Zhang
Publikováno v:
China Foundry; Jul2024, Vol. 21 Issue 4, p352-359, 8p
Autor:
Jin-he Wang, Ou-yang Li, Xue Yang, Guang Pan, Guo-lan Fan, Hou-yong Zhang, Zhi-yong Xia, Xiao-yan Sun, Hong-yu Xu, Yan-jun Chen, Chao Zhu
Publikováno v:
Air Quality, Atmosphere & Health.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::958195041197dc2e0f007af2d01cc9c0
https://doi.org/10.1007/s11869-023-01364-7
https://doi.org/10.1007/s11869-023-01364-7
Publikováno v:
Computational Optimization and Applications. 76:125-153
We propose a discretization algorithm for solving a class of nonsmooth convex semi-infinite programming problems that is based on a bundle method. Instead of employing the inexact calculation to evaluate the lower level problem, we shall carry out a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07abf24e43bfc4831cad601f190a458a
https://doi.org/10.1007/s10589-020-00170-6
https://doi.org/10.1007/s10589-020-00170-6
Publikováno v:
Acta Mathematicae Applicatae Sinica, English Series. 35:591-606
For the variational inequality with symmetric cone constraints problem, we consider using the inexact modified Newton method to efficiently solve it. It provides a unified framework for dealing with the variational inequality with nonlinear constrain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2317718e1cd6239444b06d67c307167e
https://doi.org/10.1007/s10255-019-0834-6
https://doi.org/10.1007/s10255-019-0834-6
Publikováno v:
Journal of Global Optimization. 68:537-562
We present an approximate bundle method for solving nonsmooth equilibrium problems. An inexact cutting-plane linearization of the objective function is established at each iteration, which is actually an approximation produced by an oracle that gives
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40387242bf04c6e2b8877042e0fa66f5
https://doi.org/10.1007/s10898-016-0490-9
https://doi.org/10.1007/s10898-016-0490-9
Publikováno v:
Zhongguo Zhong yao za zhi = Zhongguo zhongyao zazhi = China journal of Chinese materia medica. 44(21)
Ginsenoside F1 is a rare ginsenoside in medicinal plants such as Panax ginseng,P. notogingseng and P. quinquefolius. It has strong pharmacological activities of anti-tumor,anti-oxidation and anti-aging. In order to directly produce ginsenoside F1 by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::d8e6545310f766921aac2fc7d8661920
https://pubmed.ncbi.nlm.nih.gov/31872653
https://pubmed.ncbi.nlm.nih.gov/31872653
Publikováno v:
Material Science & Environmental Engineering - the Proceedings of 2016 International Workshop (Iwmsee2016); 2016, p398-407, 10p
In situ observations showed phytoplankton blooms appear during winter in the Taiwan Strait (TWS), but the mechanism for bloom initiation was unclear. With the use of a coupled physical–biological numerical model, we find the winter bloom is trigger
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57d3be791e85efafc2ef1050593a192a
https://www.biogeosciences-discuss.net/bg-2013-378/
https://www.biogeosciences-discuss.net/bg-2013-378/
Publikováno v:
Computational Optimization and Applications. 64:433-465
Semi-infinite problem (SIPs) are widely used in many control systems for solving complex control problem, such as polymerase chain reaction control system or other real time control system. In this paper, we present a bundle method for solving the no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a59b3cbb713bacfef75c1385321a80d
https://doi.org/10.1007/s10589-015-9810-0
https://doi.org/10.1007/s10589-015-9810-0