181 results on '"Shaohua Pan"'
Search Results
2. An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization.
3. Nonsingularity Conditions for FB System of Reformulating Nonlinear Second-Order Cone Programming
4. Fusing Monocular Images and Sparse IMU Signals for Real-time Human Motion Capture.
5. Convergence of a Class of Nonmonotone Descent Methods for Kurdyka-Łojasiewicz Optimization Problems.
6. A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems.
7. EgoLocate: Real-time Motion Capture, Localization, and Mapping with Sparse Body-mounted Sensors.
8. Calmness of partial perturbation to composite rank constraint systems and its applications.
9. Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound.
10. A matrix nonconvex relaxation approach to unconstrained binary polynomial programs.
11. A VMiPG Method for Composite Optimization with Nonsmooth Term Having No Closed-form Proximal Mapping.
12. Column $\ell_{2, 0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation.
13. Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
14. Correction to: Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
15. Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization.
16. Several Classes of Stationary Points for Rank Regularized Minimization Problems.
17. A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery.
18. Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system.
19. An inexact PAM method for computing Wasserstein barycenter with unknown supports.
20. Equivalent Lipschitz surrogates for zero-norm and rank optimization problems.
21. A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
22. Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint.
23. Error bound of local minima and KL property of exponent 1/2 for squared F-norm regularized factorization.
24. KL property of exponent 1/2 of 𝓁2, 0-norm and DC regularized factorizations for low-rank matrix recovery.
25. A rank-corrected procedure for matrix completion with fixed basis coefficients.
26. Error bounds for rank constrained optimization problems and applications.
27. Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems.
28. A Novel SINS/USBL Tightly Integrated Navigation Strategy Based on Improved ANFIS
29. Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
30. Graph-based semi-supervised learning by mixed label propagation with a soft constraint.
31. On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem.
32. The Solution of Linear Programming with LR-Fuzzy Numbers in Objective Function.
33. A REGULARIZED NEWTON METHOD FOR ℓq-NORM COMPOSITE OPTIMIZATION PROBLEMS.
34. Second-order Optimality Conditions for Mathematical Program with Semidefinite Cone Complementarity Constraints and Applications
35. Correction to: Kurdyka–Łojasiewicz Property of Zero-Norm Composite Functions
36. Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming.
37. Approximation of rank function and its application to the nearest low-rank correlation matrix.
38. The same growth of FB and NR symmetric cone complementarity functions.
39. Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs.
40. A least-square semismooth Newton method for the second-order cone complementarity problem.
41. A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation.
42. The penalized Fischer-Burmeister SOC complementarity function.
43. A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems.
44. Numerical comparisons of two effective methods for mixed complementarity problems.
45. Stationary point conditions for the FB merit function associated with symmetric cones.
46. A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions.
47. A one-parametric class of merit functions for the second-order cone complementarity problem.
48. An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming.
49. An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function.
50. Some characterizations for SOC-monotone and SOC-convex functions.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.