On the convergence of some quasi-Newton methods for nonlinear equations with nondifferentiable operators. - Xiaojun Chen 001; Tetsuro Yamamoto (Computing, 1992)

A parameterized Newton method and a quasi-Newton method for nonsmooth equations. - Xiaojun Chen 001; Liqun Qi 001 (Comput. Optim. Appl., 1994)

A parallel inexact newton method for stochastic programs with recourse. - Xiaojun Chen 001; Robert S. Womersley (Ann. Oper. Res., 1996)

A preconditioning proximal Newton method for nondifferentiable convex optimization. - Liqun Qi 001; Xiaojun Chen 001 (Math. Program., 1996)

A Verification Method for Solutions of Nonsmooth Equations. - Xiaojun Chen 001 (Computing, 1997)

Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses. - Xiaojun Chen 001; Zuhair Nashed; Liqun Qi 001 (SIAM J. Optim., 1997)

Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. - Xiaojun Chen 001; Liqun Qi 001; Defeng Sun (Math. Comput., 1998)

Proximal quasi-Newton methods for nondifferentiable convex optimization. - Xiaojun Chen 001; Masao Fukushima (Math. Program., 1999)

Numerical validation of solutions of linear complementarity problems. - Götz Alefeld; Xiaojun Chen 001; Florian A. Potra (Numerische Mathematik, 1999)

A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP. - Bintong Chen; Xiaojun Chen 001 (SIAM J. Optim., 1999)

A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints. - Bintong Chen; Xiaojun Chen 001 (Comput. Optim. Appl., 2000)

A penalized Fischer-Burmeister NCP-function. - Bintong Chen; Xiaojun Chen 001; Christian Kanzow (Math. Program., 2000)

On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem. - Xiaojun Chen 001; Yinyu Ye 001 (SIAM J. Optim., 2000)

Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations. - Xiaojun Chen 001; Zuhair Nashed; Liqun Qi 001 (SIAM J. Numer. Anal., 2000)

On convergence of SOR methods for nonsmooth equations. - Xiaojun Chen 001 (Numer. Linear Algebra Appl., 2002)

Numerical validation of solutions of complementarity The nonlinear case. - Götz Alefeld; Xiaojun Chen 001; Florian A. Potra (Numerische Mathematik, 2002)

Numerical validation of solutions of saddle point matrix equations. - Xiaojun Chen 001; Kouji Hashimoto (Numer. Linear Algebra Appl., 2003)

A Multiple-Criteria Quadratic Programming Approach to Network Intrusion Detection. - Gang Kou; Yi Peng 001; Yong Shi 001; Zhengxin Chen; Xiaojun Chen 001 (CASDMKM, 2004)

A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. - Xiaojun Chen 001; Masao Fukushima (Comput. Optim. Appl., 2004)

First Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems. - Xiaojun Chen 001 (SIAM J. Control. Optim., 2004)

Expected Residual Minimization Method for Stochastic Linear Complementarity Problems. - Xiaojun Chen 001; Masao Fukushima (Math. Oper. Res., 2005)

Finite Element Surface Fitting for Bridge Management. - Xiaojun Chen 001; Takuma Kimura (Int. J. Inf. Technol. Decis. Mak., 2006)

Computation of Error Bounds for P-matrix Linear Complementarity Problems. - Xiaojun Chen 001; Shuhuang Xiang (Math. Program., 2006)

Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs. - Xiaojun Chen 001; Robert S. Womersley (SIAM J. Numer. Anal., 2006)

A Regularized Multiple Criteria Linear Program for Classification. - Yong Shi 001; Yingjie Tian 001; Xiaojun Chen 001; Peng Zhang 001 (ICDM Workshops, 2007)

Perturbation Bounds of P-Matrix Linear Complementarity Problems. - Xiaojun Chen 001; Shuhuang Xiang (SIAM J. Optim., 2007)

Stochastic R0 Matrix Linear Complementarity Problems. - Haitao Fang; Xiaojun Chen 001; Masao Fukushima (SIAM J. Optim., 2007)

A regularized projection method for complementarity problems with non-Lipschitzian functions. - Götz Alefeld; Xiaojun Chen 001 (Math. Comput., 2008)

A verified inexact implicit Runge-Kutta method for nonsmooth ODEs. - Sayed Mahmoud; Xiaojun Chen 001 (Numer. Algorithms, 2008)

Validated Solutions of Saddle Point Linear Systems. - Takuma Kimura; Xiaojun Chen 001 (SIAM J. Matrix Anal. Appl., 2008)

Implicit Runge-Kutta Methods for Lipschitz Continuous Ordinary Differential Equations. - Xiaojun Chen 001; Sayed Mahmoud (SIAM J. Numer. Anal., 2008)

Regularized multiple criteria linear programs for classification. - Yong Shi 001; Yingjie Tian 001; Xiaojun Chen 001; Peng Zhang 001 (Sci. China Ser. F Inf. Sci., 2009)

Global error bounds for the extended vertical LCP. - Chao Zhang 056; Xiaojun Chen 001; Naihua Xiu (Comput. Optim. Appl., 2009)

Robust solution of monotone stochastic linear complementarity problems. - Xiaojun Chen 001; Chao Zhang 056; Masao Fukushima (Math. Program., 2009)

Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. - Gui-Hua Lin; Xiaojun Chen 001; Masao Fukushima (Math. Program., 2009)

Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems. - Chao Zhang 056; Xiaojun Chen 001 (SIAM J. Optim., 2009)

Error bounds for approximation in Chebyshev points. - Shuhuang Xiang; Xiaojun Chen 001; Haiyong Wang (Numerische Mathematik, 2010)

Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization. - Xiaojun Chen 001; Weijun Zhou (SIAM J. Imaging Sci., 2010)

Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems. - Weijun Zhou; Xiaojun Chen 001 (SIAM J. Optim., 2010)

Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere. - Congpei An; Xiaojun Chen 001; Ian H. Sloan; Robert S. Womersley (SIAM J. Numer. Anal., 2010)

Lower Bound Theory of Nonzero Entries in Solutions of ℓ2-ℓp Minimization. - Xiaojun Chen 001; Fengmin Xu; Yinyu Ye 001 (SIAM J. Sci. Comput., 2010)

Foreword. - Xiaojun Chen 001; Masao Fukushima (Comput. Optim. Appl., 2011)

Computation of generalized differentials in nonlinear complementarity problems. - Shuhuang Xiang; Xiaojun Chen 001 (Comput. Optim. Appl., 2011)

Preface. - C. K. Chan; Xiaojun Chen 001; Liqun Qi 001; Colin Rogers; Zhong-Ci Shi; Ian H. Sloan (J. Comput. Appl. Math., 2011)

Implicit solution function of P0 and Z matrix linear complementarity constraints. - Xiaojun Chen 001; Shuhuang Xiang (Math. Program., 2011)

Matrix computations and nonlinear equations. - Owe Axelsson; Xiaojun Chen 001 (Numer. Linear Algebra Appl., 2011)

Computational existence proofs for spherical t-designs. - Xiaojun Chen 001; Andreas Frommer; Bruno Lang (Numerische Mathematik, 2011)

AUC Maximizing Support Vector Machines with Feature Selection. - Yingjie Tian 001; Yong Shi 001; Xiaojun Chen 001; Wenjing Chen (ICCS, 2011)

Minimizing the Condition Number of a Gram Matrix. - Xiaojun Chen 001; Robert S. Womersley; Jane J. Ye (SIAM J. Optim., 2011)

Smoothing methods for nonsmooth, nonconvex minimization. - Xiaojun Chen 001 (Math. Program., 2012)

Structured matrices and tensors. - Michael K. Ng 001; Raymond H. Chan; Xiaojun Chen 001; Liqun Qi 001; Franklin T. Luk; Eugene Tyrtyshnikov (Numer. Linear Algebra Appl., 2012)

Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations. - Xiaojun Chen 001; Roger J.-B. Wets; Yanfang Zhang (SIAM J. Optim., 2012)

Regularized Least Squares Approximations on the Sphere Using Spherical Designs. - Congpei An; Xiaojun Chen 001; Ian H. Sloan; Robert S. Womersley (SIAM J. Numer. Anal., 2012)

Non-Lipschitz lp-Regularization and Box Constrained Model for Image Restoration. - Xiaojun Chen 001; Michael K. Ng 001; Chao Zhang 056 (IEEE Trans. Image Process., 2012)

Smoothing Neural Network for Constrained Non-Lipschitz Optimization With Applications. - Wei Bian; Xiaojun Chen 001 (IEEE Trans. Neural Networks Learn. Syst., 2012)

Newton iterations in implicit time-stepping scheme for differential linear complementarity systems. - Xiaojun Chen 001; Shuhuang Xiang (Math. Program., 2013)

Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization. - Wei Bian; Xiaojun Chen 001 (SIAM J. Optim., 2013)

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization. - Xiaojun Chen 001; Lingfeng Niu; Yaxiang Yuan (SIAM J. Optim., 2013)

Convergence of Regularized Time-Stepping Methods for Differential Variational Inequalities. - Xiaojun Chen 001; Zhengyu Wang (SIAM J. Optim., 2013)

Preface. - Xiaojun Chen 001; Nobuo Yamashita (Comput. Optim. Appl., 2014)

Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2-ℓ p minimization. - Xiaojun Chen 001; Weijun Zhou (Comput. Optim. Appl., 2014)

Regularizations for Stochastic Linear Variational Inequalities. - Yanfang Zhang; Xiaojun Chen 001 (J. Optim. Theory Appl., 2014)

Complexity of unconstrained $$L_2-L_p$$ minimization. - Xiaojun Chen 001; Dongdong Ge; Zizhuo Wang 001; Yinyu Ye 001 (Math. Program., 2014)

Differential variational inequality approach to dynamic games with shared constraints. - Xiaojun Chen 001; Zhengyu Wang (Math. Program., 2014)

Corrigendum: Regularized Least Squares Approximations on the Sphere Using Spherical Designs. - Congpei An; Xiaojun Chen 001; Ian H. Sloan; Robert S. Womersley (SIAM J. Numer. Anal., 2014)

Neural Network for Nonsmooth, Nonconvex Constrained Minimization Via Smooth Approximation. - Wei Bian; Xiaojun Chen 001 (IEEE Trans. Neural Networks Learn. Syst., 2014)

Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence. - Zhaosong Lu; Xiaojun Chen 001 (CoRR, 2015)

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. - Wei Bian; Xiaojun Chen 001; Yinyu Ye 001 (Math. Program., 2015)

Linearly Constrained Non-Lipschitz Optimization for Image Restoration. - Wei Bian; Xiaojun Chen 001 (SIAM J. Imaging Sci., 2015)

Regularized Mathematical Programs with Stochastic Equilibrium Constraints: Estimating Structural Demand Models. - Xiaojun Chen 001; Hailin Sun; Roger J.-B. Wets (SIAM J. Optim., 2015)

Newton's Method for Monte Carlo-Based Residuals. - Jeffrey Willert; Xiaojun Chen 001; C. T. Kelley (SIAM J. Numer. Anal., 2015)

Sparse solutions of linear complementarity problems. - Xiaojun Chen 001; Shuhuang Xiang (Math. Program., 2016)

Penalty Methods for a Class of Non-Lipschitz Optimization Problems. - Xiaojun Chen 001; Zhaosong Lu; Ting Kei Pong (SIAM J. Optim., 2016)

Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity. - Xiaojun Chen 001; Philippe L. Toint; Hong Wang (CoRR, 2017)

Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization. - Wei Bian; Xiaojun Chen 001 (Math. Oper. Res., 2017)

Two-stage stochastic variational inequalities: an ERM-solution procedure. - Xiaojun Chen 001; Ting Kei Pong; Roger J.-B. Wets (Math. Program., 2017)

SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model. - Hailin Sun; Che-Lin Su; Xiaojun Chen 001 (Math. Program., 2017)

Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction. - Lei Yang 030; Ting Kei Pong; Xiaojun Chen 001 (SIAM J. Imaging Sci., 2017)

Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems. - Bo Wen; Xiaojun Chen 001; Ting Kei Pong (SIAM J. Optim., 2017)

An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming. - Xiaojun Chen 001; Lei Guo 016; Zhaosong Lu; Jane J. Ye (SIAM J. Numer. Anal., 2017)

A proximal difference-of-convex algorithm with extrapolation. - Bo Wen; Xiaojun Chen 001; Ting Kei Pong (Comput. Optim. Appl., 2018)

Spherical t휀-designs for approximations on the sphere. - Yang Zhou 018; Xiaojun Chen 001 (Math. Comput., 2018)

Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence. - Zhaosong Lu; Xiaojun Chen 001 (Math. Oper. Res., 2018)

Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere. - Xiaojun Chen 001; Robert S. Womersley (SIAM J. Imaging Sci., 2018)

A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints. - Bin Gao 007; Xin Liu 001; Xiaojun Chen 001; Ya-Xiang Yuan (SIAM J. Optim., 2018)

A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems. - Lei Yang 030; Ting Kei Pong; Xiaojun Chen 001 (SIAM J. Optim., 2018)

A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization. - Xiaojun Chen 001; C. T. Kelley; Fengmin Xu; Zaikun Zhang (SIAM J. Sci. Comput., 2018)

Least-Element Time-Stepping Methods for Simulation of Linear Networks with Ideal Switches. - Shuhuang Xiang; Xiaojun Chen 001; Yang Zhou 018 (Circuits Syst. Signal Process., 2019)

Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems. - Xiaojun Chen 001; Hailin Sun; Huifu Xu (Math. Program., 2019)

Convergence Analysis of Sample Average Approximation of Two-Stage Stochastic Generalized Equations. - Xiaojun Chen 001; Alexander Shapiro 001; Hailin Sun (SIAM J. Optim., 2019)

Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. - Xiaojun Chen 001; Philippe L. Toint; Hong Wang (SIAM J. Optim., 2019)

Convergence of the EDIIS Algorithm for Nonlinear Equations. - Xiaojun Chen 001; C. T. Kelley (SIAM J. Sci. Comput., 2019)

Quantitative analysis for a class of two-stage stochastic linear variational inequality problems. - Jie Jiang 003; Xiaojun Chen 001; Zhiping Chen (Comput. Optim. Appl., 2020)

The subdifferential of measurable composite max integrands and smoothing approximation. - James V. Burke; Xiaojun Chen 001; Hailin Sun (Math. Program., 2020)

A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization. - Chao Zhang 056; Xiaojun Chen 001 (SIAM J. Optim., 2020)

A Smoothing Proximal Gradient Algorithm for Nonsmooth Convex Regression with Cardinality Penalty. - Wei Bian; Xiaojun Chen 001 (SIAM J. Numer. Anal., 2020)

Choroid Segmentation of Retinal OCT Images Based on CNN Classifier and l 2 - l q Fitter. - Fang He; Rachel Ka Man Chun; Zicheng Qiu; Shijie Yu; Yun Shi; Chi Ho To; Xiaojun Chen 001 (Comput. Math. Methods Medicine, 2021)

A polynomial-time algorithm for simple undirected graph isomorphism. - Jing He 004; Jinjun Chen; Guangyan Huang; Jie Cao 001; Zhiwang Zhang; Hui Zheng 001; Peng Zhang 063; Roozbeh Zarei; Ferry Sansoto; Ruchuan Wang 001; Yimu Ji 001; Weibei Fan; et al. (Concurr. Comput. Pract. Exp., 2021)

A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds. - Chao Zhang 056; Xiaojun Chen 001; Shiqian Ma (CoRR, 2021)

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. - Xiaojun Chen 001; Philippe L. Toint (Math. Program., 2021)

Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation. - Lei Guo 016; Xiaojun Chen 001 (Math. Program., 2021)

Anderson Acceleration for a Class of Nonsmooth Fixed-Point Problems. - Wei Bian; Xiaojun Chen 001; C. T. Kelley (SIAM J. Sci. Comput., 2021)

A polynomial-time algorithm for simple undirected graph isomorphism. - Jing He 004; Guangyan Huang; Jie Cao 001; Zhiwang Zhang; Hui Zheng 001; Peng Zhang 063; Roozbeh Zarei; Ferry Susanto; Ruchuan Wang 001; Yimu Ji 001; Weibei Fan; Zhijun Xie; et al. (Concurr. Comput. Pract. Exp., 2022)

Tight Error Bounds for Nonnegative Orthogonality Constraints and Exact Penalties. - Xiaojun Chen 001; Yifan He; Zaikun Zhang (CoRR, 2022)

Sparse Solutions of a Class of Constrained Optimization Problems. - Lei Yang 030; Xiaojun Chen 001; Shuhuang Xiang (Math. Oper. Res., 2022)

Linearly Constrained Nonsmooth Optimization for Training Autoencoders. - Wei Liu 044; Xin Liu 001; Xiaojun Chen 001 (SIAM J. Optim., 2022)

Distributionally robust stochastic variational inequalities. - Hailin Sun; Alexander Shapiro 001; Xiaojun Chen 001 (Math. Program., 2023)

Lifted stationary points of sparse optimization with complementarity constraints. - Shisen Liu; Xiaojun Chen 001 (Comput. Optim. Appl., 2023)

Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints. - Jie Jiang 003; Xiaojun Chen 001 (Math. Program., 2023)

Solution sets of three sparse optimization problems for multivariate regression. - Xiaojun Chen 001; Lili Pan 003; Naihua Xiu (J. Glob. Optim., 2023)

A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn. - Chao Zhang 056; Xiaojun Chen 001; Shiqian Ma (Math. Oper. Res., 2024)

Data-Driven Distributionally Robust Multiproduct Pricing Problems under Pure Characteristics Demand Models. - Jie Jiang 003; Hailin Sun; Xiaojun Chen 001 (SIAM J. Optim., 2024)

A Quasi-Newton Subspace Trust Region Algorithm for Nonmonotone Variational Inequalities in Adversarial Learning over Box Constraints. - Zicheng Qiu; Jie Jiang 003; Xiaojun Chen 001 (J. Sci. Comput., 2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold. - Xiaojun Chen 001; Yifan He; Zaikun Zhang (SIAM J. Optim., 2025)

An Augmented Lagrangian Method for Training Recurrent Neural Networks. - Yue Wang 102; Chao Zhang 056; Xiaojun Chen 001 (SIAM J. Sci. Comput., 2025)