default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaihua Xiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j66]Hui Zhang
, Shenglong Zhou, Geoffrey Ye Li, Naihua Xiu, Yiju Wang:
A step function based recursion method for 0/1 deep neural networks. Appl. Math. Comput. 488: 129129 (2025)- 2023
- [j65]Chun-Na Li, Yuan-Hai Shao, Huajun Wang, Ling-Wei Huang, Yu-Ting Zhao, Naihua Xiu, Nai-Yang Deng:
Union nonparallel support vector machines framework with consistency. Appl. Soft Comput. 136: 110129 (2023) - [j64]Xiaojun Chen, Lili Pan, Naihua Xiu:
Solution sets of three sparse optimization problems for multivariate regression. J. Glob. Optim. 87(2): 347-371 (2023) - [j63]Hui Zhang, Zhengpeng Yuan, Naihua Xiu:
Recursion Newton-Like Algorithm for l2,0-ReLU Deep Neural Networks. IEEE Trans. Neural Networks Learn. Syst. 34(9): 5882-5896 (2023) - 2022
- [j62]Penghe Zhang, Rui Wang, Naihua Xiu:
Multinomial logistic regression classifier via lq, 0-proximal Newton algorithm. Neurocomputing 468: 148-164 (2022) - [j61]Chen Zhao, Naihua Xiu, Houduo Qi, Ziyan Luo:
A Lagrange-Newton algorithm for sparse nonlinear programming. Math. Program. 195(1): 903-928 (2022) - [j60]Jian Shen, Jein-Shan Chen, Hou-Duo Qi, Naihua Xiu:
A penalized method of alternating projections for weighted low-rank hankel matrix optimization. Math. Program. Comput. 14(3): 417-450 (2022) - [j59]Huajun Wang, Yuan-Hai Shao, Naihua Xiu:
Proximal operator and optimality conditions for ramp loss SVM. Optim. Lett. 16(3): 999-1014 (2022) - [j58]Huajun Wang, Yuan-Hai Shao, Shenglong Zhou, Ce Zhang, Naihua Xiu:
Support Vector Machine Classifier via $L_{0/1}$L0/1 Soft-Margin Loss. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 7253-7265 (2022) - [j57]Shenglong Zhou, Ziyan Luo, Naihua Xiu, Geoffrey Ye Li:
Computing One-Bit Compressive Sensing via Double-Sparsity Constrained Optimization. IEEE Trans. Signal Process. 70: 1593-1608 (2022) - [i7]Hui Zhang, Shenglong Zhou, Geoffrey Ye Li, Naihua Xiu:
0/1 Deep Neural Networks via Block Coordinate Descent. CoRR abs/2206.09379 (2022) - [i6]Hui Zhang, Xin Liu, Naihua Xiu:
Optimality Analysis and Block Sparse Algorithm for Complex Compressed Sensing. CoRR abs/2208.14666 (2022) - 2021
- [j56]Rui Wang, Naihua Xiu, Kim-Chuan Toh:
Subspace quadratic regularization method for group sparse multinomial logistic regression. Comput. Optim. Appl. 79(3): 531-559 (2021) - [j55]Rui Wang, Naihua Xiu, Shenglong Zhou:
An extended Newton-type algorithm for ℓ2-regularized sparse logistic regression and its efficiency for classifying large-scale datasets. J. Comput. Appl. Math. 397: 113656 (2021) - [j54]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit. J. Mach. Learn. Res. 22: 12:1-12:45 (2021) - [j53]Shenglong Zhou, Lili Pan, Naihua Xiu:
Newton method for ℓ0-regularized optimization. Numer. Algorithms 88(4): 1541-1570 (2021) - [j52]Hui Zhang, Lili Pan, Naihua Xiu:
Optimality conditions for locally Lipschitz optimization with l0-regularization. Optim. Lett. 15(1): 189-203 (2021) - [j51]Shenglong Zhou, Lili Pan, Naihua Xiu, Hou-Duo Qi:
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization. SIAM J. Optim. 31(4): 3184-3211 (2021) - 2020
- [j50]Xinrong Li, Naihua Xiu, Shenglong Zhou:
Matrix Optimization Over Low-Rank Spectral Sets: Stationary Points and Local and Global Minimizers. J. Optim. Theory Appl. 184(3): 895-930 (2020) - [j49]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12(3): 337-387 (2020) - [j48]Rui Wang, Naihua Xiu, Chao Zhang:
Greedy Projected Gradient-Newton Method for Sparse Logistic Regression. IEEE Trans. Neural Networks Learn. Syst. 31(2): 527-538 (2020)
2010 – 2019
- 2019
- [j47]Houduo Qi, Yiju Wang, Naihua Xiu:
Preface. Asia Pac. J. Oper. Res. 36(2): 1902001:1-1902001:2 (2019) - [j46]Zhiyong Huang, Ziyan Luo, Naihua Xiu:
High-Dimensional Least-Squares with Perfect Positive Correlation. Asia Pac. J. Oper. Res. 36(4): 1950016:1-1950016:16 (2019) - [j45]Ziyan Luo, Defeng Sun, Kim-Chuan Toh, Naihua Xiu:
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method. J. Mach. Learn. Res. 20: 106:1-106:25 (2019) - [i5]Chun-Na Li, Yuan-Hai Shao, Huajun Wang, Yu-Ting Zhao, Ling-Wei Huang, Naihua Xiu, Nai-Yang Deng:
Single Versus Union: Non-parallel Support Vector Machine Frameworks. CoRR abs/1910.09734 (2019) - [i4]Huajun Wang, Yuan-Hai Shao, Shenglong Zhou, Ce Zhang, Naihua Xiu:
Support Vector Machine Classifier via L0/1 Soft-Margin Loss. CoRR abs/1912.07418 (2019) - 2018
- [j44]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints. IEEE Trans. Signal Process. 66(16): 4331-4346 (2018) - 2017
- [j43]Biao Qu, Changyu Wang, Naihua Xiu:
Analysis on Newton projection method for the split feasibility problem. Comput. Optim. Appl. 67(1): 175-199 (2017) - [j42]Dingtao Peng, Naihua Xiu, Jian Yu:
(S1/2) regularization methods and fixed point algorithms for affine rank minimization problems. Comput. Optim. Appl. 67(3): 543-569 (2017) - [j41]Ai-Fan Ling, Jie Sun, Naihua Xiu, Xiaoguang Yang:
Robust two-stage stochastic linear optimization with risk aversion. Eur. J. Oper. Res. 256(1): 215-229 (2017) - [j40]Lili Pan, Ziyan Luo, Naihua Xiu:
Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming. J. Optim. Theory Appl. 175(1): 104-118 (2017) - [j39]Ziyan Luo, Liqun Qi, Naihua Xiu:
The sparsest solutions to Z-tensor complementarity problems. Optim. Lett. 11(3): 471-482 (2017) - 2016
- [j38]Chen Zhao, Ziyan Luo, Naihua Xiu:
Low-order penalty equations for semidefinite linear complementarity problems. Oper. Res. Lett. 44(3): 342-347 (2016) - [c2]Jun Fan, Lingchen Kong, Liqun Wang, Naihua Xiu:
The Uniqueness and Greedy Method for Quadratic Compressive Sensing. DSAA 2016: 808-815 - 2015
- [j37]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties. Algorithmica 73(2): 460-482 (2015) - [j36]Donglei Du, Naihua Xiu, Dachuan Xu:
Guest Editorial. Asia Pac. J. Oper. Res. 32(1): 1502001:1-1502001:2 (2015) - [j35]Kok Lay Teo, Soon-Yi Wu, Naihua Xiu:
Special issue on "optimization and optimal control with applications" for the 9th international conference on optimization: techniques and applications (9th ICOTA), December 12-16, 2013, Taipei, Taiwan. J. Glob. Optim. 62(4): 615 (2015) - [j34]Shuanghua Bai, Hou-Duo Qi, Naihua Xiu:
Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach. SIAM J. Optim. 25(1): 439-467 (2015) - 2014
- [j33]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties. J. Comb. Optim. 27(3): 609-620 (2014) - [j32]Ziyan Luo, Linxia Qin, Lingchen Kong, Naihua Xiu:
The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement. J. Optim. Theory Appl. 160(3): 854-864 (2014) - [j31]Meijuan Shang, Chao Zhang, Naihua Xiu:
Minimal Zero Norm Solutions of Linear Complementarity Problems. J. Optim. Theory Appl. 163(3): 795-814 (2014) - [j30]Yongqiang Chen, Naihua Xiu, Dingtao Peng:
Global solutions of non-Lipschitz $$S_{2}$$ S 2 - $$S_{p}$$ S p minimization over the positive semidefinite cone. Optim. Lett. 8(7): 2053-2064 (2014) - [j29]Chao Zhang, Liping Jing, Naihua Xiu:
A New Active Set Method For Nonnegative Matrix Factorization. SIAM J. Sci. Comput. 36(6) (2014) - 2013
- [j28]Lingchen Kong, Naihua Xiu:
Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization. Asia Pac. J. Oper. Res. 30(3) (2013) - [j27]Yu Li, Jia Shu, Xi Wang, Naihua Xiu, Dachuan Xu, Jiawei Zhang:
Approximation Algorithms for Integrated Distribution Network Design Problems. INFORMS J. Comput. 25(3): 572-584 (2013) - [j26]Dingtao Peng, Jian Yu, Naihua Xiu:
Generic uniqueness theorems with some applications. J. Glob. Optim. 56(2): 713-725 (2013) - [j25]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties. Theor. Comput. Sci. 476: 109-117 (2013) - [j24]Houduo Qi, Naihua Xiu, Xiaoming Yuan:
A Lagrangian Dual Approach to the Single-Source Localization Problem. IEEE Trans. Signal Process. 61(15): 3815-3826 (2013) - [c1]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty. COCOON 2013: 292-303 - [i3]Shenglong Zhou, Lingchen Kong, Ziyan Luo, Naihua Xiu:
New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing. CoRR abs/1308.0455 (2013) - [i2]Shenglong Zhou, Naihua Xiu, Yingnan Wang, Lingchen Kong:
Exact Recovery for Sparse Signal via Weighted l_1 Minimization. CoRR abs/1312.2358 (2013) - 2012
- [j23]Linxia Qin, Naihua Xiu, Lingchen Kong, Yu Li:
Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays. Comput. Math. Methods Medicine 2012: 646045:1-646045:8 (2012) - [j22]Yu Li, Dachuan Xu, Donglei Du, Naihua Xiu:
Improved approximation algorithms for the robust fault-tolerant facility location problem. Inf. Process. Lett. 112(10): 361-364 (2012) - [j21]Jinchuan Zhou, Naihua Xiu, Changyu Wang:
Saddle point and exact penalty representation for generalized proximal Lagrangians. J. Glob. Optim. 54(4): 669-687 (2012) - [j20]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems. J. Optim. Theory Appl. 153(2): 357-376 (2012) - [j19]Ding-Tao Peng, Jian Yu, Nai-Hua Xiu:
Generic Uniqueness of Solutions for a Class of Vector Ky Fan Inequalities. J. Optim. Theory Appl. 155(1): 165-179 (2012) - [j18]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems. Math. Program. 133(1-2): 327-336 (2012) - 2011
- [j17]Qingna Li, Houduo Qi, Naihua Xiu:
Block relaxation and majorization methods for the nearest correlation matrix with factor structure. Comput. Optim. Appl. 50(2): 327-349 (2011) - [j16]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming. J. Optim. Theory Appl. 148(2): 364-389 (2011) - [j15]Yingnan Wang, Naihua Xiu:
Strong Semismoothness of Projection onto Slices of Second-Order Cone. J. Optim. Theory Appl. 150(3): 599-614 (2011) - [j14]Yingnan Wang, Naihua Xiu, Ziyan Luo:
A regularized strong duality for nonsymmetric semidefinite least squares problem. Optim. Lett. 5(4): 665-682 (2011) - [i1]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery. CoRR abs/1106.3276 (2011) - 2010
- [j13]Jianzhong Zhang, Biao Qu, Naihua Xiu:
Some projection-like methods for the generalized Nash equilibria. Comput. Optim. Appl. 45(1): 89-109 (2010)
2000 – 2009
- 2009
- [j12]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems. Asia Pac. J. Oper. Res. 26(2): 199-233 (2009) - [j11]Chao Zhang, Xiaojun Chen, Naihua Xiu:
Global error bounds for the extended vertical LCP. Comput. Optim. Appl. 42(3): 335-352 (2009) - 2008
- [j10]Lingchen Kong, Naihua Xiu, Jiye Han:
The solution set structure of monotone linear complementarity problems over second-order cone. Oper. Res. Lett. 36(1): 71-76 (2008) - [j9]Lingchen Kong, Jie Sun, Naihua Xiu:
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems. SIAM J. Optim. 19(3): 1028-1047 (2008) - 2007
- [j8]Lingchen Kong, Naihua Xiu:
New smooth C-functions for symmetric cone complementarity problems. Optim. Lett. 1(4): 391-400 (2007) - 2003
- [j7]Muhammad Aslam Noor, Yiju Wang, Naihua Xiu:
Some new projection methods for variational inequalities. Appl. Math. Comput. 137(2-3): 423-435 (2003) - [j6]Naihua Xiu, Jianzhong Zhang:
Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP. J. Glob. Optim. 26(2): 183-198 (2003) - 2002
- [j5]Naihua Xiu, Jianzhong Zhang:
A characteristic quantity of P-matrices. Appl. Math. Lett. 15(1): 41-46 (2002) - [j4]Jianzhong Zhang, Naihua Xiu:
New projection-type methods for monotone LCP with finite termination. Numerische Mathematik 92(1): 179-195 (2002) - 2000
- [j3]Changyu Wang, Naihua Xiu:
Convergence of the Gradient Projection Method for Generalized Convex Minimization. Comput. Optim. Appl. 16(2): 111-120 (2000) - [j2]Jianzhong Zhang, Naihua Xiu:
Global s -type error bound for the extended linear complementarity problem and applications. Math. Program. 88(2): 391-410 (2000)
1990 – 1999
- 1999
- [j1]Bintong Chen, Naihua Xiu:
A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions. SIAM J. Optim. 9(3): 605-623 (1999)
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-08 21:30 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:
