Shaohua Pan

Orcid: 0000-0002-6261-5268

According to our database1, Shaohua Pan authored at least 50 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound.
Comput. Optim. Appl., November, 2023

A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems.
SIAM J. Optim., September, 2023

EgoLocate: Real-time Motion Capture, Localization, and Mapping with Sparse Body-mounted Sensors.
ACM Trans. Graph., August, 2023

Calmness of partial perturbation to composite rank constraint systems and its applications.
J. Glob. Optim., April, 2023

A matrix nonconvex relaxation approach to unconstrained binary polynomial programs.
Comput. Optim. Appl., April, 2023

Convergence of a Class of Nonmonotone Descent Methods for Kurdyka-Łojasiewicz Optimization Problems.
SIAM J. Optim., 2023

Fusing Monocular Images and Sparse IMU Signals for Real-time Human Motion Capture.
Proceedings of the SIGGRAPH Asia 2023 Conference Papers, 2023

2022
Column $\ell_{2, 0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation.
SIAM J. Optim., 2022

2021
Correction to: Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
J. Optim. Theory Appl., 2021

Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
J. Optim. Theory Appl., 2021

Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization.
J. Glob. Optim., 2021

An inexact PAM method for computing Wasserstein barycenter with unknown supports.
Comput. Appl. Math., 2021

2020
Several Classes of Stationary Points for Rank Regularized Minimization Problems.
SIAM J. Optim., 2020

A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery.
Math. Program. Comput., 2020

2019
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system.
Optim. Lett., 2019

Error bound of local minima and KL property of exponent 1/2 for squared F-norm regularized factorization.
CoRR, 2019

KL property of exponent 1/2 of 𝓁<sub>2, 0</sub>-norm and DC regularized factorizations for low-rank matrix recovery.
CoRR, 2019

2018
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems.
J. Glob. Optim., 2018

2017
Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint.
SIAM J. Control. Optim., 2017

2016
Error bounds for rank constrained optimization problems and applications.
Oper. Res. Lett., 2016

A rank-corrected procedure for matrix completion with fixed basis coefficients.
Math. Program., 2016

Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems.
Comput. Optim. Appl., 2016

2014
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation.
SIAM J. Sci. Comput., 2014

On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem.
Math. Comput., 2014

Graph-based semi-supervised learning by mixed label propagation with a soft constraint.
Inf. Sci., 2014

2013
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming.
Numer. Algorithms, 2013

Approximation of rank function and its application to the nearest low-rank correlation matrix.
J. Glob. Optim., 2013

2012
The same growth of FB and NR symmetric cone complementarity functions.
Optim. Lett., 2012

2011
Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs.
SIAM J. Optim., 2011

A least-square semismooth Newton method for the second-order cone complementarity problem.
Optim. Methods Softw., 2011

A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation.
J. Glob. Optim., 2011

The penalized Fischer-Burmeister SOC complementarity function.
Comput. Optim. Appl., 2011

2010
Stationary point conditions for the FB merit function associated with symmetric cones.
Oper. Res. Lett., 2010

Numerical comparisons of two effective methods for mixed complementarity problems.
J. Comput. Appl. Math., 2010

A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems.
Inf. Sci., 2010

A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions.
Comput. Optim. Appl., 2010

A one-parametric class of merit functions for the second-order cone complementarity problem.
Comput. Optim. Appl., 2010

An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming.
Comput. Optim. Appl., 2010

2009
Some characterizations for SOC-monotone and SOC-convex functions.
J. Glob. Optim., 2009

An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function.
J. Comput. Appl. Math., 2009

2008
A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming.
SIAM J. Optim., 2008

A global continuation algorithm for solving binary quadratic programming problems.
Comput. Optim. Appl., 2008

A family of NCP functions and a descent method for the nonlinear complementarity problem.
Comput. Optim. Appl., 2008

2007
Smoothing method for minimizing the sum of the <i>r</i> largest functions.
Optim. Methods Softw., 2007

Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming.
J. Glob. Optim., 2007

Two unconstrained optimization approaches for the Euclidean kappa-centrum location problem.
Appl. Math. Comput., 2007

The Solution of Linear Programming with LR-Fuzzy Numbers in Objective Function.
Proceedings of the Fuzzy Information and Engineering, 2007

2006
An efficient algorithm for the smallest enclosing ball problem in high dimensions.
Appl. Math. Comput., 2006

2005
An efficient algorithm for the Euclidean r-centrum location problem.
Appl. Math. Comput., 2005

2004
A self-adjusting primal-dual interior point method for linear programs.
Optim. Methods Softw., 2004


  Loading...