Naihua Xiu

According to our database1, Naihua Xiu authored at least 52 papers between 1999 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 




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

APJOR, 2019

High-Dimensional Least-Squares with Perfect Positive Correlation.
APJOR, 2019

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

The sparsest solutions to Z-tensor complementarity problems.
Optimization Letters, 2017

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

Robust two-stage stochastic linear optimization with risk aversion.
European Journal of Operational Research, 2017

Analysis on Newton projection method for the split feasibility problem.
Comp. Opt. and Appl., 2017

(S1/2) regularization methods and fixed point algorithms for affine rank minimization problems.
Comp. Opt. and Appl., 2017

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

Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach.
SIAM Journal on Optimization, 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. Global Optimization, 2015

Guest Editorial.
APJOR, 2015

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

A New Active Set Method For Nonnegative Matrix Factorization.
SIAM J. Scientific Computing, 2014

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

Minimal Zero Norm Solutions of Linear Complementarity Problems.
J. Optimization Theory and Applications, 2014

The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement.
J. Optimization Theory and Applications, 2014

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

A Lagrangian Dual Approach to the Single-Source Localization Problem.
IEEE Trans. Signal Processing, 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. Global Optimization, 2013

Approximation Algorithms for Integrated Distribution Network Design Problems.
INFORMS Journal on Computing, 2013

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

New RIC Bounds via l_q-minimization with 0 (DOI)
CoRR, 2013

Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization.
APJOR, 2013

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

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. Optimization Theory and Applications, 2012

Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems.
J. Optimization Theory and Applications, 2012

Saddle point and exact penalty representation for generalized proximal Lagrangians.
J. Global Optimization, 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.
Comp. Math. Methods in Medicine, 2012

A regularized strong duality for nonsymmetric semidefinite least squares problem.
Optimization Letters, 2011

Strong Semismoothness of Projection onto Slices of Second-Order Cone.
J. Optimization Theory and Applications, 2011

Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming.
J. Optimization Theory and Applications, 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.
Comp. Opt. and Appl., 2011

Some projection-like methods for the generalized Nash equilibria.
Comp. Opt. and Appl., 2010

Global error bounds for the extended vertical LCP.
Comp. Opt. and Appl., 2009

Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems.
APJOR, 2009

A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems.
SIAM Journal on Optimization, 2008

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

New smooth C-functions for symmetric cone complementarity problems.
Optimization Letters, 2007

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

Some new projection methods for variational inequalities.
Applied Mathematics and Computation, 2003

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

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

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

Convergence of the Gradient Projection Method for Generalized Convex Minimization.
Comp. Opt. and Appl., 2000

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