The following pages link to Zheng-Hai Huang (Q247024):
Displaying 50 items.
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
- Global uniqueness and solvability for tensor complementarity problems (Q306296) (← links)
- The Hölder continuity of Löwner's operator in Euclidean Jordan algebras (Q395833) (← links)
- (Q476642) (redirect page) (← links)
- Strictly nonnegative tensors and nonnegative tensor partition (Q476643) (← links)
- A homogeneous smoothing-type algorithm for symmetric cone linear programs (Q477482) (← links)
- A fixed point method for the linear complementarity problem arising from American option pricing (Q519227) (← links)
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem (Q523577) (← links)
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
- A nonmonotone smoothing Newton algorithm for solving box constrained variational inequalities with a \(P_0\) function (Q549906) (← links)
- Convergence of a non-interior continuation algorithm for the monotone SCCP (Q601939) (← links)
- A generalized Newton method for absolute value equations associated with second order cones (Q609239) (← links)
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
- Polynomial time solvability of non-symmetric semidefinite programming (Q613324) (← links)
- A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
- The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces (Q620526) (← links)
- Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483) (← links)
- A new class of penalized NCP-functions and its properties (Q645547) (← links)
- Alternating direction method for bi-quadratic programming (Q652699) (← links)
- GUS-property for Lorentz cone linear complementarity problems on Hilbert spaces (Q657279) (← links)
- Copositive tensor detection and its applications in physics and hypergraphs (Q683337) (← links)
- Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
- Properties of a family of merit functions and a merit function method for the NCP (Q716527) (← links)
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
- Solvability of variational inequality problems (Q819337) (← links)
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities (Q847182) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- A smoothing-type algorithm for solving system of inequalities (Q939536) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- A revised cut-peak function method for box constrained continuous global optimization (Q990665) (← links)
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems (Q1026431) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search (Q1041534) (← links)
- Non-interior continuation method for solving the monotone semidefinite complementarity problem (Q1401571) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
- A primal-dual interior point method for parametric semidefinite programming problems (Q1568250) (← links)
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem (Q1609708) (← links)
- Error bounds for the solution sets of quadratic complementarity problems (Q1626539) (← links)
- Global uniqueness and solvability of tensor variational inequalities (Q1637354) (← links)
- Copositivity detection of tensors: theory and algorithm (Q1673917) (← links)
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms (Q1678114) (← links)
- Solution sets of quadratic complementarity problems (Q1706410) (← links)
- Positive definiteness of paired symmetric tensors and elasticity tensors (Q1743944) (← links)
- Theorems of the alternative for inequality systems of real polynomials (Q1762405) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms (Q1774596) (← links)
- A smoothing Newton algorithm for mathematical programs with complementarity constraints (Q1780125) (← links)
