default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhongming Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Zhongming Wu, Guoyu Xie, Zhili Ge, Valentina De Simone
:
Nonconvex multi-period mean-variance portfolio optimization. Ann. Oper. Res. 332(1): 617-644 (2024)- [j25]Zhongming Wu, Ye Song, Ying Ji, Shaojian Qu, Zaiwu Gong:
Data-driven distributionally robust support vector machine method for multiple criteria sorting problem with uncertainty. Appl. Soft Comput. 149(Part A): 110957 (2024) - [j24]Zhongming Wu, Pan Gao, Yiran Wang, Xiaoxia Xu, Neng Wan, Francisco Javier Cabrerizo:
Robust minimum cost consensus models with uncertain asymmetric costs based on linear uncertain-constrained tolerance level. Eng. Appl. Artif. Intell. 130: 107699 (2024) - [j23]Zhongming Wu, Kexin Sun, Zhili Ge, Zhihua Allen-Zhao, Tieyong Zeng:
Sparse portfolio optimization via ℓ1 over ℓ2 regularization. Eur. J. Oper. Res. 319(3): 820-833 (2024) - [j22]Tingting Wu, Yue Min, Chaoyan Huang, Zhi Li, Zhongming Wu, Tieyong Zeng:
An Efficient Inexact Gauss-Seidel-Based Algorithm for Image Restoration with Mixed Noise. J. Sci. Comput. 99(2): 54 (2024) - [j21]Zhongming Wu, Ye Song, Fan Jiang:
Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems. Optim. Lett. 18(2): 447-470 (2024) - [j20]Zhongming Wu, Chaoyan Huang, Tieyong Zeng:
Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration. SIAM J. Imaging Sci. 17(2): 1145-1181 (2024) - [i8]Chaoyan Huang, Zhongming Wu, Tieyong Zeng:
Edge-guided Low-light Image Enhancement with Inertial Bregman Alternating Linearized Minimization. CoRR abs/2403.01142 (2024) - [i7]Zhongming Wu, Chaoyan Huang, Tieyong Zeng:
Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration. CoRR abs/2403.01144 (2024) - [i6]Chaoyan Huang, Zhongming Wu, Yanqi Cheng, Tieyong Zeng, Carola-Bibiane Schönlieb, Angelica I. Avilés-Rivero:
Deep Block Proximal Linearised Minimisation Algorithm for Non-convex Inverse Problems. CoRR abs/2406.02458 (2024) - 2023
- [j19]Zhongming Wu, Liu Yang, Yue Fei, Xiulai Wang:
Regularization methods for sparse ESG-valued multi-period portfolio optimization with return prediction using machine learning. Expert Syst. Appl. 232: 120850 (2023) - [j18]Fan Jiang, Zhongming Wu:
An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems. J. Comput. Appl. Math. 417: 114628 (2023) - [j17]Zhili Ge, Zhongming Wu, Xin Zhang, Qin Ni:
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems. J. Glob. Optim. 86(4): 821-844 (2023) - [i5]Feng-Lei Fan, Hang-Cheng Dong, Zhongming Wu, Lecheng Ruan, Tieyong Zeng, Yiming Cui, Jing-Xiao Liao:
One Neuron Saved Is One Neuron Earned: On Parametric Efficiency of Quadratic Networks. CoRR abs/2303.06316 (2023) - [i4]Yiming Cui, Lecheng Ruan, Hang-Cheng Dong, Qiang Li, Zhongming Wu, Tieyong Zeng, Feng-Lei Fan:
Cloud-RAIN: Point Cloud Analysis with Reflectional Invariance. CoRR abs/2305.07814 (2023) - 2022
- [j16]Zhongming Wu, Min Li:
General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis. Asia Pac. J. Oper. Res. 39(5): 2150044:1-2150044:27 (2022) - [j15]Zhongming Wu, Xingju Cai, Min Li, Leyu Hu:
Optimal mixed charging schemes for traffic congestion management with subsidy to new energy vehicle users. Int. Trans. Oper. Res. 29(1): 6-23 (2022) - [j14]Fan Jiang, Zhongming Wu, Xingju Cai, Hongchao Zhang:
Unified linear convergence of first-order primal-dual algorithms for saddle point problems. Optim. Lett. 16(6): 1675-1700 (2022) - 2021
- [j13]Min Li, Zhongming Wu:
On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming. Asia Pac. J. Oper. Res. 38(1): 2050035:1-2050035:34 (2021) - [j12]Xiaoxia Xu, Zaiwu Gong, Weiwei Guo, Zhongming Wu, Enrique Herrera-Viedma, Francisco Javier Cabrerizo:
Optimization consensus modeling of a closed-loop carbon quota trading mechanism regarding revenue and fairness. Comput. Ind. Eng. 161: 107611 (2021) - [j11]Zehui Jia, Jieru Huang, Zhongming Wu:
An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems. J. Comput. Appl. Math. 390: 113384 (2021) - [j10]Zhongming Wu, Chongshou Li, Min Li, Andrew Lim:
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Glob. Optim. 79(3): 617-644 (2021) - [j9]Fan Jiang, Xingju Cai, Zhongming Wu, Deren Han:
Approximate first-order primal-dual algorithms for saddle point problems. Math. Comput. 90(329): 1227-1262 (2021) - [j8]Fan Jiang, Zhongming Wu, Xingju Cai, Hongchao Zhang:
A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems. Numer. Algorithms 88(3): 1109-1136 (2021) - [j7]Shixiong Wang, Zhongming Wu, Andrew Lim:
Denoising, Outlier/Dropout Correction, and Sensor Selection in Range-Based Positioning. IEEE Trans. Instrum. Meas. 70: 1-13 (2021) - [j6]Shixiong Wang, Zhongming Wu, Andrew Lim:
Robust State Estimation for Linear Systems Under Distributional Uncertainty. IEEE Trans. Signal Process. 69: 5963-5978 (2021)
2010 – 2019
- 2019
- [j5]Zhongming Wu, Min Li:
General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems. Comput. Optim. Appl. 73(1): 129-158 (2019) - [j4]Zhongming Wu, Foxiang Liu, Min Li:
A proximal Peaceman-Rachford splitting method for solving the multi-block separable convex minimization problems. Int. J. Comput. Math. 96(4): 708-728 (2019) - [j3]Min Li, Zhongming Wu:
Convergence Analysis of the Generalized Splitting Methods for a Class of Nonconvex Optimization Problems. J. Optim. Theory Appl. 183(2): 535-565 (2019) - [c2]Zhongming Wu, Kai Wang, Zhangjin Zhou:
Accelerated Proximal Gradient Method with Line Search for Large-Scale Nonconvex Penalty Problems. ICBDC 2019: 281-286 - 2017
- [j2]Zhongming Wu, Min Li, David Z. W. Wang, Deren Han:
A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems. Asia Pac. J. Oper. Res. 34(6): 1750030:1-1750030:27 (2017) - 2014
- [j1]Yiyuan Luo, Xuejia Lai, Zhongming Wu, Guang Gong:
A unified method for finding impossible differentials of block cipher structures. Inf. Sci. 263: 211-220 (2014)
2000 – 2009
- 2009
- [c1]Zhongming Wu, Yiyuan Luo, Xuejia Lai, Bo Zhu:
Improved Cryptanalysis of the FOX Block Cipher. INTRUST 2009: 236-249 - [i3]Yiyuan Luo, Xuejia Lai, Zheng Gong, Zhongming Wu:
Pseudorandomness Analysis of the Lai-Massey Scheme. IACR Cryptol. ePrint Arch. 2009: 266 (2009) - [i2]Zhongming Wu, Xuejia Lai, Bo Zhu, Yiyuan Luo:
Impossible Differential Cryptanalysis of FOX. IACR Cryptol. ePrint Arch. 2009: 357 (2009) - [i1]Yiyuan Luo, Zhongming Wu, Xuejia Lai, Guang Gong:
A Unified Method for Finding Impossible Differentials of Block Cipher Structures. IACR Cryptol. ePrint Arch. 2009: 627 (2009)
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-09-10 02:07 CEST 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:
