Naihua Xiu

Orcid: 0000-0002-3129-2005

According to our database1, Naihua Xiu authored at least 75 papers between 1999 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A step function based recursion method for 0/1 deep neural networks.
Appl. Math. Comput., 2025

2023
Solution sets of three sparse optimization problems for multivariate regression.
J. Glob. Optim., November, 2023

Recursion Newton-Like Algorithm for l<sub>2,0</sub>-ReLU Deep Neural Networks.
IEEE Trans. Neural Networks Learn. Syst., September, 2023

Union nonparallel support vector machines framework with consistency.
Appl. Soft Comput., March, 2023

2022
Computing One-Bit Compressive Sensing via Double-Sparsity Constrained Optimization.
IEEE Trans. Signal Process., 2022

Support Vector Machine Classifier via $L_{0/1}$L0/1 Soft-Margin Loss.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

Proximal operator and optimality conditions for ramp loss SVM.
Optim. Lett., 2022

A penalized method of alternating projections for weighted low-rank hankel matrix optimization.
Math. Program. Comput., 2022

A Lagrange-Newton algorithm for sparse nonlinear programming.
Math. Program., 2022

Multinomial logistic regression classifier via lq, 0-proximal Newton algorithm.
Neurocomputing, 2022

Optimality Analysis and Block Sparse Algorithm for Complex Compressed Sensing.
CoRR, 2022

0/1 Deep Neural Networks via Block Coordinate Descent.
CoRR, 2022

2021
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization.
SIAM J. Optim., 2021

Optimality conditions for locally Lipschitz optimization with l<sub>0</sub>-regularization.
Optim. Lett., 2021

Newton method for ℓ<sub>0</sub>-regularized optimization.
Numer. Algorithms, 2021

Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit.
J. Mach. Learn. Res., 2021

An extended Newton-type algorithm for ℓ2-regularized sparse logistic regression and its efficiency for classifying large-scale datasets.
J. Comput. Appl. Math., 2021

Subspace quadratic regularization method for group sparse multinomial logistic regression.
Comput. Optim. Appl., 2021

2020
Greedy Projected Gradient-Newton Method for Sparse Logistic Regression.
IEEE Trans. Neural Networks Learn. Syst., 2020

Robust Euclidean embedding via EDM optimization.
Math. Program. Comput., 2020

Matrix Optimization Over Low-Rank Spectral Sets: Stationary Points and Local and Global Minimizers.
J. Optim. Theory Appl., 2020

2019
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method.
J. Mach. Learn. Res., 2019

Support Vector Machine Classifier via L<sub>0/1</sub> Soft-Margin Loss.
CoRR, 2019

Single Versus Union: Non-parallel Support Vector Machine Frameworks.
CoRR, 2019

Preface.
Asia Pac. J. Oper. Res., 2019

High-Dimensional Least-Squares with Perfect Positive Correlation.
Asia Pac. J. Oper. Res., 2019

2018
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints.
IEEE Trans. Signal Process., 2018

2017
The sparsest solutions to Z-tensor complementarity problems.
Optim. Lett., 2017

Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming.
J. Optim. Theory Appl., 2017

Robust two-stage stochastic linear optimization with risk aversion.
Eur. J. Oper. Res., 2017

Analysis on Newton projection method for the split feasibility problem.
Comput. Optim. Appl., 2017

(S<sub>1/2</sub>) regularization methods and fixed point algorithms for affine rank minimization problems.
Comput. Optim. Appl., 2017

2016
Low-order penalty equations for semidefinite linear complementarity problems.
Oper. Res. Lett., 2016

The Uniqueness and Greedy Method for Quadratic Compressive Sensing.
Proceedings of the 2016 IEEE International Conference on Data Science and Advanced Analytics, 2016

2015
Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach.
SIAM J. Optim., 2015

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., 2015

Guest Editorial.
Asia Pac. J. Oper. Res., 2015

Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties.
Algorithmica, 2015

2014
A New Active Set Method For Nonnegative Matrix Factorization.
SIAM J. Sci. Comput., 2014

Global solutions of non-Lipschitz $$S_{2}$$ S 2 - $$S_{p}$$ S p minimization over the positive semidefinite cone.
Optim. Lett., 2014

Minimal Zero Norm Solutions of Linear Complementarity Problems.
J. Optim. Theory Appl., 2014

The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement.
J. Optim. Theory Appl., 2014

A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties.
J. Comb. Optim., 2014

2013
A Lagrangian Dual Approach to the Single-Source Localization Problem.
IEEE Trans. Signal Process., 2013

A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties.
Theor. Comput. Sci., 2013

Generic uniqueness theorems with some applications.
J. Glob. Optim., 2013

Approximation Algorithms for Integrated Distribution Network Design Problems.
INFORMS J. Comput., 2013

Exact Recovery for Sparse Signal via Weighted l_1 Minimization.
CoRR, 2013

New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing.
CoRR, 2013

Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization.
Asia Pac. J. Oper. Res., 2013

Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.
Math. Program., 2012

Generic Uniqueness of Solutions for a Class of Vector Ky Fan Inequalities.
J. Optim. Theory Appl., 2012

Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems.
J. Optim. Theory Appl., 2012

Saddle point and exact penalty representation for generalized proximal Lagrangians.
J. Glob. Optim., 2012

Improved approximation algorithms for the robust fault-tolerant facility location problem.
Inf. Process. Lett., 2012

Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays.
Comput. Math. Methods Medicine, 2012

2011
A regularized strong duality for nonsymmetric semidefinite least squares problem.
Optim. Lett., 2011

Strong Semismoothness of Projection onto Slices of Second-Order Cone.
J. Optim. Theory Appl., 2011

Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming.
J. Optim. Theory Appl., 2011

Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery
CoRR, 2011

Block relaxation and majorization methods for the nearest correlation matrix with factor structure.
Comput. Optim. Appl., 2011

2010
Some projection-like methods for the generalized Nash equilibria.
Comput. Optim. Appl., 2010

2009
Global error bounds for the extended vertical LCP.
Comput. Optim. Appl., 2009

Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems.
Asia Pac. J. Oper. Res., 2009

2008
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems.
SIAM J. Optim., 2008

The solution set structure of monotone linear complementarity problems over second-order cone.
Oper. Res. Lett., 2008

2007
New smooth C-functions for symmetric cone complementarity problems.
Optim. Lett., 2007

2003
Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP.
J. Glob. Optim., 2003

Some new projection methods for variational inequalities.
Appl. Math. Comput., 2003

2002
New projection-type methods for monotone LCP with finite termination.
Numerische Mathematik, 2002

A characteristic quantity of P-matrices.
Appl. Math. Lett., 2002

2000
Global <i>s</i> -type error bound for the extended linear complementarity problem and applications.
Math. Program., 2000

Convergence of the Gradient Projection Method for Generalized Convex Minimization.
Comput. Optim. Appl., 2000

1999
A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions.
SIAM J. Optim., 1999


  Loading...