35 citations · 158 across the 37 of their papers we have counts for
12 papers · 1 filter
Sharp-Peak Functions for Exactly Penalizing Binary Integer Programming
Shenglong Zhou, Shuai Li, Hui Zhang +1
Unconstrained binary integer programming (UBIP) is a challenging optimization problem due to the presence of binary variables. To address the challenge, we introduce a novel class…
Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
Shuai Li, Shenglong Zhou, Ziyan Luo
Quadratically constrained quadratic programming (QCQP) has long been recognized as a computationally challenging problem, particularly in large-scale or high-dimensional settings w…
Variable T-Product and Zero-Padding Tensor Completion with Applications
Liqun Qi, Rui Yan, Ziyan Luo +2
The T-product method based upon Discrete Fourier Transformation (DFT) has found wide applications in engineering, in particular, in image processing. In this paper, we propose vari…
Sparse least squares solutions of multilinear equations
Xin Li, Ziyan Luo, Yang Chen
In this paper, we propose a sparse least squares (SLS) optimization model for solving multilinear equations, in which the sparsity constraint on the solutions can effectively reduc…
Dual Quaternion Matrices in Multi-Agent Formation Control
Liqun Qi, Xiangke Wang, Ziyan Luo
Three kinds of dual quaternion matrices associated with the mutual visibility graph, namely the relative configuration adjacency matrix, the logarithm adjacency matrix and the rela…
Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds
Xinrong Li, Ziyan Luo
The low-rank matrix optimization with affine manifold (rank-MOA) aims to minimize a continuously differentiable function over a low-rank set intersecting with an affine manifold. T…
Computing One-bit Compressive Sensing via Double-Sparsity Constrained Optimization
Shenglong Zhou, Ziyan Luo, Naihua Xiu +1
One-bit compressive sensing gains its popularity in signal processing and communications due to its low storage costs and low hardware complexity. However, it has been a challengin…
Quaternion Matrix Optimization and The Underlying Calculus
Liqun Qi, Ziyan Luo, Qingwen Wang +1
Optimization models involving quaternion matrices are widely used in color image process and other engineering areas. These models optimize real functions of quaternion matrix vari…
A Lagrange-Newton Algorithm for Sparse Nonlinear Programming
Chen Zhao, Naihua Xiu, Hou-Duo Qi +1
The sparse nonlinear programming (SNP) problem has wide applications in signal and image processing, machine learning, pattern recognition, finance and management, etc. However, th…
A Lagrangian Dual Based Approach to Sparse Linear Programming
Chen Zhao, Ziyan Luo, Weiyue Li +2
A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically a…
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method
Ziyan Luo, Defeng Sun, Kim-Chuan Toh +1
The octagonal shrinkage and clustering algorithm for regression (OSCAR), equipped with the -norm and a pair-wise -norm regularizer, is a useful tool for feat…
Z-tensors and complementarity problems
M. Seetharama Gowda, Ziyan Luo, Liqun Qi +1
Tensors are multidimensional analogs of matrices. In this paper, based on degree-theoretic ideas, we study homogeneous nonlinear complementarity problems induced by tensors. By spe…