default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZaikun Zhang
Person information
- unicode name: 张在坤
- affiliation: Hong Kong Polytechnic University, Department of Applied Mathematics, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Tom M. Ragonneau, Zaikun Zhang:
PDFO: a cross-platform package for Powell's derivative-free optimization solvers. Math. Program. Comput. 16(4): 535-559 (2024)- [j7]Tom M. Ragonneau, Zaikun Zhang:
An optimal interpolation set for model-based derivative-free optimization methods. Optim. Methods Softw. 39(4): 898-910 (2024) - [j6]Tianchen Gu
, Wangzhen Li, Aidong Zhao, Zhaori Bi, Xudong Li, Fan Yang, Changhao Yan, Wenchuang Walter Hu, Dian Zhou, Tao Cui, Xin Liu, Zaikun Zhang, Xuan Zeng:
BBGP-sDFO: Batch Bayesian and Gaussian Process Enhanced Subspace Derivative Free Optimization for High-Dimensional Analog Circuit Synthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(2): 417-430 (2024) - [c1]Tianchen Gu, Ruiyu Lyu, Zhaori Bi, Changhao Yan, Fan Yang, Dian Zhou, Tao Cui, Xin Liu, Zaikun Zhang, Xuan Zeng:
HiMOSS: A Novel High-dimensional Multi-objective Optimization Method via Adaptive Gradient-Based Subspace Sampling for Analog Circuit Sizing. DAC 2024: 233:1-233:6 - 2022
- [i1]Xiaojun Chen, Yifan He, Zaikun Zhang:
Tight Error Bounds for Nonnegative Orthogonality Constraints and Exact Penalties. CoRR abs/2210.05164 (2022)
2010 – 2019
- 2019
- [j5]Serge Gratton, Clément W. Royer, Luís Nunes Vicente, Zaikun Zhang:
Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72(3): 525-559 (2019) - 2018
- [j4]Xiaojun Chen, C. T. Kelley, Fengmin Xu, Zaikun Zhang:
A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization. SIAM J. Sci. Comput. 40(4): A2174-A2199 (2018) - 2016
- [j3]Mahdi Dodangeh, Luís Nunes Vicente, Zaikun Zhang:
On the optimal order of worst case complexity of direct search. Optim. Lett. 10(4): 699-708 (2016) - 2015
- [j2]Serge Gratton, Clément W. Royer, Luís Nunes Vicente, Zaikun Zhang:
Direct Search Based on Probabilistic Descent. SIAM J. Optim. 25(3): 1515-1541 (2015) - 2014
- [j1]Zaikun Zhang:
Sobolev seminorm of quadratic functions with applications to derivative-free optimization. Math. Program. 146(1-2): 77-96 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
