The following pages link to Shaohua Pan (Q276858):
Displaying 50 items.
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems (Q276859) (← links)
- A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming (Q370062) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions (Q442689) (← links)
- Graph-based semi-supervised learning by mixed label propagation with a soft constraint (Q506127) (← links)
- The penalized Fischer-Burmeister SOC complementarity function (Q548683) (← links)
- A merit function method for infinite-dimensional SOCCPs (Q549841) (← links)
- Stationary point conditions for the FB merit function associated with symmetric cones (Q613328) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- (Q643931) (redirect page) (← links)
- New second-order cone linear complementarity formulation and semi-smooth Newton algorithm for finite element analysis of 3D frictional contact problem (Q643932) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- The same growth of FB and NR symmetric cone complementarity functions (Q691418) (← links)
- Lagrangian regularization approach to constrained optimization problems (Q703420) (← links)
- A self-adjusting interior point algorithm for linear complementarity problems (Q814067) (← links)
- A damped Gauss-Newton method for the second-order cone complementarity problem (Q836060) (← links)
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function (Q843152) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs (Q939548) (← links)
- Nonsmooth model for plastic limit analysis and its smoothing algorithm (Q940085) (← links)
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs (Q960900) (← links)
- Numerical comparisons of two effective methods for mixed complementarity problems (Q966077) (← links)
- A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- A family of NCP functions and a descent method for the nonlinear complementarity problem (Q1001190) (← links)
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property (Q1005258) (← links)
- A one-parametric class of merit functions for the symmetric cone complementarity problem (Q1018348) (← links)
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems (Q1029282) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Some characterizations for SOC-monotone and SOC-convex functions (Q1037358) (← links)
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems (Q1756795) (← links)
- Error bounds for rank constrained optimization problems and applications (Q1790190) (← links)
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming (Q1938082) (← links)
- An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
- Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
- Correction to: ``Kurdyka-Łojasiewicz property of zero-norm composite functions'' (Q2046571) (← links)
- Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- A proximal gradient descent method for the extended second-order cone linear complementarity problem (Q2268076) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems (Q2269819) (← links)
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system (Q2311202) (← links)
- Computation of graphical derivatives of normal cone maps to a class of conic constraint sets (Q2328207) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm (Q2416614) (← links)
- A descent method for a reformulation of the second-order cone complementarity problem (Q2479359) (← links)
