4 papers · 1 filter
Optimality Conditions for Sparse Bilinear Least Squares Problems
Zixin Deng, Zheng-Hai Huang, Yun-Bin Zhao
The first-order optimality conditions of sparse bilinear least squares problems are studied. The so-called T-type and N-type stationary points for this problem are characterized in…
On NP-Hardness of Minimization and Bound Theory of Nonzero Entries in Solutions
Min Tao, Xiao-Ping Zhang, Yun-Bin Zhao
The \(L_1/L_2\) norm ratio has gained significant attention as a measure of sparsity due to three merits: sharper approximation to the \(L_0\) norm compared to the \(L_1\) norm, be…
Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
Chen Xu, Yun-Bin Zhao, Zhipeng Lu +1
We design a new iterative algorithm, called REINFORCE-OPT, for solving a general type of optimization problems. This algorithm parameterizes the solution search rule and iterativel…
Equivalence and Strong Equivalence between Sparsest and Least -Norm Nonnegative Solutions of Linear Systems and Their Application
Yun-Bin Zhao
Many practical problems can be formulated as l0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear system…