huangzhenghai@tju.edu.cn
运筹学与控制论
无
教授
大规模稀疏优化问题的理论与算法

---

张量变分不等式的理论与算法

---

张量填充问题的理论与算法

Connectedness of the solution set of the tensor complementarity problem

---

An introduction to the computational complexity of matrix multiplication

---

Properties of the nonnegative solution set of multi-linear equations

---

A note on the nonemptiness and compactness of solution sets of weakly homogeneous variational inequalities

---

Nonemptiness and compactness of solution sets to GPCPs

---

On phaseless compressed sensing with partially known support

---

Recognition of colored face, based on an improved color local binary pattern

---

Global error bounds for the tensor complementarity problem with a P-tensor

---

The sparsest solution of the union of finite polytopes via its nonconvex relaxati

---

Tensor complementarity problems-part II: solution methods

---

Tensor complementarity problems-part I: basic theory

---

An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: An adapted algorithmic framew

---

Estimations on upper and lower bounds of bounds to a class of tensor complementarity

---

Stability of solutions and continuity of solution maps of tensor complementarity problems

---

Properties of S-tensor

---

Iterative p-shrinkage thresholding algorithm for low Tucker rank tensor recovery

---

A singular value p-shrinkage thresholding algorithm for low rank matrix recovery

---

Tensor complementarity problems-part III: applications

---

Test of copositive tensors

---

Adaptive propagation matting on transparency of image

---

Copositive tensor detection and its applications in physics and hypergraphs

---

A single gallery-based face recognition using extended joint sparse representation

---

Global uniqueness and solvability of tensor variational inequalities

---

线性等式与不等式组稀疏解的唯一性条件

---

Error bounds for the solution set of quadratic complementarity problems

---

Low Tucker rank recovery via ADMM based on exact and inexact iteratively reweighted algorithms

---

Solution sets of quadratic complementarity problems

---

Copositive tensor detection and its applications in physics and hypergraphs

---

Positive definiteness of paired symmetric tensor and elasticity tensors

---

Positive definiteness of paired symmetric tensors and elasticity tensors

---

Formulating an n-person noncooperative game as a tensor complementarity problem

---

Copositivity detection of tensors: theory and algorithm

---

A theoretical perspective of solving phaseless compressive sensing via its nonconvex relation

---

LBP-like feature on Gabor wavelets for face recognition

---

Formulating an n-person noncooperative game as a tensor complementarity problem

---

A fixed point method for the linear complementarity problem arising from American option pricing

---

A fixed point method for the linear complementarity problem arising from American option pricing

---

Exceptionally regular tensors and complementarity problems

---

Gabor-scale binary pattern for face recognition

---

A customized sparse representation model with mixed norm for undersampled face recognition

---

An iterative algorithm for third-order tensor multi-rank minimization

---

Global uniqueness and solvability for tensor complementarity problems

---

Common's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors

---

A splitting augmented Lagrangian method for low multilinear-rank tensor recovery

---

Entropy function-based algorithms for solving a class of nonconvex minimization problems

---

Non-uniform patch based face recognition via 2D-DWT

---

Conditions for the equivalence between the low-n-rank tensor recovery problem and its convex relaxation

---

Minimum $n$-rank approximation via iterative hard thresholding

---

Face recognition based on pixel-level and feature-level fusion of the top-level's wavelet sub-bands

---

Variational feature representation-based classification for face recognition with single sample per person

---

A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems

---

A homogeneous smoothing-type algorithm for symmetric cone linear programs

---

A large-scale network data analysis via sparse and low rank reconstruction

---

A reweighted nuclear norm minimization algorithm for low rank matrix recovery

---

Strictly nonnegative tensors and nonnegative tensor partition

---

Several developments of variational inequalities and complementarity problems, bilevel programming and MPEC

---

Finding the extreme Z-eigenvalues of tensors via a sequential SDPs method

---

On determinants and eigenvalue theory of tensors

---

Restricted p-isometry properties of nonconvex matrix recovery

---

The Holder continuity of Lowner's operator in Euclidean Jordan algebras

---

A fixed point iterative method for low n-rank tensor pursuit

---

Three classes of merit functions for the complementarity problem over a closed convex cone

---

The sparsest solution to the system of absolute value equations