default search action
Mingwang Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Ziyi Zhang, Liming Zhang, Pengbin Wang, Mingwang Zhang, Tao Tan:
Robust watermarking algorithm based on mahalanobis distance and ISS feature point for 3D point cloud data. Earth Sci. Informatics 17(1): 783-796 (2024) - [j9]Tao Tan
, Liming Zhang
Commutative encryption and watermarking algorithm based on compound chaotic systems and zero-watermarking for vector map. Comput. Geosci. 184: 105530 (2024) - [j8]Shuaikang Liu, Liming Zhang
Homomorphic encryption domain asymmetric fingerprinting scheme for 3D models of oblique photography. Trans. GIS 28(4): 790-815 (2024) - [j7]Shuo Wang
Study on Weak Signal Feature Extraction Based on Asymmetric Hybrid Bistable Stochastic Resonance. IEEE Trans. Instrum. Meas. 73: 1-15 (2024) - 2021
- [j6]Mingwang Zhang, Kun Huang
Correction to: A new full-Newton step interior-point method for P*(κ)-LCP based on a positive-asymptotic kernel function. J. Appl. Math. Comput. 67(1-2): 731 (2021) - 2020
- [j5]Mingwang Zhang, Kun Huang
A new full-Newton step interior-point method for $$P_{*}(\kappa )$$-LCP based on a positive-asymptotic kernel function. J. Appl. Math. Comput. 64(1-2): 313-330 (2020)
2010 – 2019
- 2019
- [j4]Mingwang Zhang, Beibei Yuan, Yiyuan Zhou, Xiaoyu Luo, Zhengwei Huang:
A primal-dual interior-point algorithm with arc-search for semidefinite programming. Optim. Lett. 13(5): 1157-1175 (2019) - 2015
- [j3]Xin Li
Interior-point algorithm for linear optimization based on a new trigonometric kernel function. Oper. Res. Lett. 43(5): 471-475 (2015) - 2014
- [j2]Danhua Zhu, Mingwang Zhang:
A full-Newton step infeasible interior-point algorithm for P*(κ) linear complementarity problem. J. Syst. Sci. Complex. 27(5): 1027-1044 (2014) - 2012
- [j1]Mingwang Zhang:
A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization. J. Syst. Sci. Complex. 25(6): 1108-1121 (2012) - 2010
- [c7]Mingwang Zhang, Huaping Chen, Weihua Li:
A finite termination mehrotra-type predictor-corrector algorithm for Semidefinite Optimization. BIC-TA 2010: 937-942 - [c6]Yanli Lv, Mingwang Zhang:
A wide-neighborhood interior-point method for P*(κ) complementarity problem. IWACI 2010: 506-510 - [c5]Qiang Hu, Mingwang Zhang:
A Second-Order Modified Version of Mehrotra-type Predictor-Corrector Algorithm for Convex Quadratic Optimization. ICSI (2) 2010: 430-438
2000 – 2009
- 2009
- [c4]Huaping Chen, Mingwang Zhang, Yuqin Zhao:
A Class of New Large-Update Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems. ISNN (3) 2009: 77-87 - 2008
- [c3]Yanli Lv, Mingwang Zhang:
A Wide-Neighborhood Algorithm for Monotone Nonlinear Complementarity Problem. FSKD (3) 2008: 498-502 - [c2]Yuqin Zhao, Mingwang Zhang:
A Wide Neighborhood Primal-Dual Interior-Point Algorithm for a Class of Convex Programming. ICIC (2) 2008: 734-741 - [c1]Mingwang Zhang, Yanli Lv:
Extension of a Polynomial Time Mehrotra-Type Predictor-Corrector Safeguarded Algorithm to Monotone Linear Complementarity Problems. ISNN (1) 2008: 826-835
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-12-01 00:07 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: