default search action
Shaohua Pan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j49]Ruyu Liu, Shaohua Pan, Yuqia Wu
, Xiaoqi Yang:
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization. Comput. Optim. Appl. 88(2): 603-641 (2024) - [j48]Taiwei Zhang, Shaohua Pan, Ruyu Liu:
A VMiPG Method for Composite Optimization with Nonsmooth Term Having No Closed-form Proximal Mapping. J. Sci. Comput. 101(3): 69 (2024) - [j47]Shujun Bi
Sparse Signal Reconstruction: Sequential Convex Relaxation, Restricted Null Space Property, and Error Bounds. IEEE Trans. Inf. Theory 70(11): 8378-8398 (2024) - 2023
- [j46]Yitian Qian, Shaohua Pan, Shujun Bi:
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs. Comput. Optim. Appl. 84(3): 875-919 (2023) - [j45]Dongdong Zhang, Shaohua Pan, Shujun Bi, Defeng Sun:
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound. Comput. Optim. Appl. 86(2): 627-667 (2023) - [j44]Yitian Qian, Shaohua Pan, Yulan Liu:
Calmness of partial perturbation to composite rank constraint systems and its applications. J. Glob. Optim. 85(4): 867-889 (2023) - [j43]Yitian Qian, Shaohua Pan:
Convergence of a Class of Nonmonotone Descent Methods for Kurdyka-Łojasiewicz Optimization Problems. SIAM J. Optim. 33(2): 638-651 (2023) - [j42]Yuqia Wu
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems. SIAM J. Optim. 33(3): 1676-1706 (2023) - [j41]Xinyu Yi
EgoLocate: Real-time Motion Capture, Localization, and Mapping with Sparse Body-mounted Sensors. ACM Trans. Graph. 42(4): 76:1-76:17 (2023) - [c2]Shaohua Pan
Fusing Monocular Images and Sparse IMU Signals for Real-time Human Motion Capture. SIGGRAPH Asia 2023: 116:1-116:11 - [i6]Xinyu Yi, Yuxiao Zhou, Marc Habermann, Vladislav Golyanik, Shaohua Pan, Christian Theobalt
EgoLocate: Real-time Motion Capture, Localization, and Mapping with Sparse Body-mounted Sensors. CoRR abs/2305.01599 (2023) - [i5]Shaohua Pan, Qi Ma, Xinyu Yi, Weifeng Hu, Xiong Wang, Xingkang Zhou, Jijunnan Li, Feng Xu:
Fusing Monocular Images and Sparse IMU Signals for Real-time Human Motion Capture. CoRR abs/2309.00310 (2023) - 2022
- [j40]Ting Tao, Yitian Qian, Shaohua Pan:
Column $\ell_{2, 0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation. SIAM J. Optim. 32(2): 959-988 (2022) - 2021
- [j39]Yitian Qian, Shaohua Pan:
An inexact PAM method for computing Wasserstein barycenter with unknown supports. Comput. Appl. Math. 40(2) (2021) - [j38]Ting Tao, Shaohua Pan, Shujun Bi:
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization. J. Glob. Optim. 81(4): 991-1017 (2021) - [j37]Yuqia Wu
Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions. J. Optim. Theory Appl. 188(1): 94-112 (2021) - [j36]Yuqia Wu, Shaohua Pan, Shujun Bi:
Correction to: Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions. J. Optim. Theory Appl. 190(1): 339-342 (2021) - 2020
- [j35]Shujun Bi, Shaohua Pan, Defeng Sun
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. Math. Program. Comput. 12(4): 569-602 (2020) - [j34]Yulan Liu, Shujun Bi, Shaohua Pan:
Several Classes of Stationary Points for Rank Regularized Minimization Problems. SIAM J. Optim. 30(2): 1756-1775 (2020)
2010 – 2019
- 2019
- [j33]Ying Sun, Shaohua Pan, Shujun Bi:
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system. Optim. Lett. 13(5): 1095-1110 (2019) - [i4]Shujun Bi, Ting Tao, Shaohua Pan:
KL property of exponent 1/2 of 𝓁2, 0-norm and DC regularized factorizations for low-rank matrix recovery. CoRR abs/1908.09078 (2019) - [i3]Ting Tao, Shaohua Pan, Shujun Bi:
Error bound of local minima and KL property of exponent 1/2 for squared F-norm regularized factorization. CoRR abs/1911.04293 (2019) - 2018
- [j32]Yulan Liu, Shujun Bi, Shaohua Pan:
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. J. Glob. Optim. 72(4): 679-704 (2018) - [i2]Yulan Liu, Shujun Bi, Shaohua Pan:
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. CoRR abs/1804.11062 (2018) - 2017
- [j31]Shujun Bi, Shaohua Pan:
Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint. SIAM J. Control. Optim. 55(4): 2493-2518 (2017) - 2016
- [j30]Le Han, Shujun Bi, Shaohua Pan:
Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems. Comput. Optim. Appl. 64(1): 119-148 (2016) - [j29]Weimin Miao, Shaohua Pan, Defeng Sun
A rank-corrected procedure for matrix completion with fixed basis coefficients. Math. Program. 159(1-2): 289-338 (2016) - [j28]Shujun Bi, Shaohua Pan:
Error bounds for rank constrained optimization problems and applications. Oper. Res. Lett. 44(3): 336-341 (2016) - 2014
- [j27]Xiaolan Liu, Shaohua Pan, Zhifeng Hao, Zhiyong Lin:
Graph-based semi-supervised learning by mixed label propagation with a soft constraint. Inf. Sci. 277: 327-337 (2014) - [j26]Shaohua Pan, Sangho Kum, Yongdo Lim, Jein-Shan Chen
On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem. Math. Comput. 83(287): 1143-1171 (2014) - [j25]Shujun Bi, Xiaolan Liu, Shaohua Pan:
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation. SIAM J. Sci. Comput. 36(4) (2014) - 2013
- [j24]Shujun Bi, Le Han, Shaohua Pan:
Approximation of rank function and its application to the nearest low-rank correlation matrix. J. Glob. Optim. 57(4): 1113-1137 (2013) - [j23]Le Han, Shujun Bi, Shaohua Pan:
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming. Numer. Algorithms 62(1): 79-113 (2013) - 2012
- [j22]Shujun Bi, Shaohua Pan, Jein-Shan Chen
The same growth of FB and NR symmetric cone complementarity functions. Optim. Lett. 6(1): 153-162 (2012) - [i1]Weimin Miao, Shaohua Pan, Defeng Sun:
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients. CoRR abs/1210.3709 (2012) - 2011
- [j21]Shaohua Pan, Jein-Shan Chen
The penalized Fischer-Burmeister SOC complementarity function. Comput. Optim. Appl. 49(3): 457-491 (2011) - [j20]Jein-Shan Chen
A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation. J. Glob. Optim. 50(4): 713-728 (2011) - [j19]Shaohua Pan, Jein-Shan Chen
A least-square semismooth Newton method for the second-order cone complementarity problem. Optim. Methods Softw. 26(1): 1-22 (2011) - [j18]Shujun Bi, Shaohua Pan, Jein-Shan Chen
Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs. SIAM J. Optim. 21(4): 1392-1417 (2011) - 2010
- [j17]Shaohua Pan, Jein-Shan Chen
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions. Comput. Optim. Appl. 45(1): 59-88 (2010) - [j16]Jein-Shan Chen
A one-parametric class of merit functions for the second-order cone complementarity problem. Comput. Optim. Appl. 45(3): 581-606 (2010) - [j15]Jein-Shan Chen
An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming. Comput. Optim. Appl. 47(3): 477-499 (2010) - [j14]Jein-Shan Chen
A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems. Inf. Sci. 180(5): 697-711 (2010) - [j13]Jein-Shan Chen
Numerical comparisons of two effective methods for mixed complementarity problems. J. Comput. Appl. Math. 234(3): 667-683 (2010) - [j12]Shaohua Pan, Yu-Lin Chang
Stationary point conditions for the FB merit function associated with symmetric cones. Oper. Res. Lett. 38(5): 372-377 (2010)
2000 – 2009
- 2009
- [j11]Jein-Shan Chen
An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function. J. Comput. Appl. Math. 232(2): 455-471 (2009) - [j10]Jein-Shan Chen
Some characterizations for SOC-monotone and SOC-convex functions. J. Glob. Optim. 45(2): 259-279 (2009) - 2008
- [j9]Jein-Shan Chen
A family of NCP functions and a descent method for the nonlinear complementarity problem. Comput. Optim. Appl. 40(3): 389-404 (2008) - [j8]Shaohua Pan, Tao Tan, Yuxi Jiang:
A global continuation algorithm for solving binary quadratic programming problems. Comput. Optim. Appl. 41(3): 349-362 (2008) - [j7]Shaohua Pan, Jein-Shan Chen
A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming. SIAM J. Optim. 19(2): 883-910 (2008) - 2007
- [j6]Shaohua Pan, Jein-Shan Chen
Two unconstrained optimization approaches for the Euclidean kappa-centrum location problem. Appl. Math. Comput. 189(2): 1368-1383 (2007) - [j5]Shaohua Pan, Jein-Shan Chen
Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. J. Glob. Optim. 39(4): 555-575 (2007) - [j4]Shaohua Pan, Suyan He, Xingsi Li:
Smoothing method for minimizing the sum of the r largest functions. Optim. Methods Softw. 22(2): 267-277 (2007) - [c1]Qianfeng Cai, Zhifeng Hao, Shaohua Pan:
The Solution of Linear Programming with LR-Fuzzy Numbers in Objective Function. ICFIE 2007: 988-999 - 2006
- [j3]Shaohua Pan, Xingsi Li:
An efficient algorithm for the smallest enclosing ball problem in high dimensions. Appl. Math. Comput. 172(1): 49-61 (2006) - 2005
- [j2]Shaohua Pan, Xingsi Li:
An efficient algorithm for the Euclidean r-centrum location problem. Appl. Math. Comput. 167(1): 716-728 (2005) - 2004
- [j1]Shaohua Pan, Xiangsi Li:
A self-adjusting primal-dual interior point method for linear programs. Optim. Methods Softw. 19(3-4): 389-397 (2004)
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-12-02 22:28 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: