Author of the publication

The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction.

, , , , and . J. Optimization Theory and Applications, 170 (3): 1009-1025 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Using the Split Bregman Algorithm to Solve the Self-Repelling Snake Model., , , , , , and . CoRR, (2020)The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction., , , , and . J. Optimization Theory and Applications, 170 (3): 1009-1025 (2016)Parameter selection for nonnegative l1 matrix/tensor sparse decomposition., , , and . Oper. Res. Lett., 43 (4): 423-426 (2015)An efficient alternating minimization method for fourth degree polynomial optimization., , , and . J. Glob. Optim., 82 (1): 83-103 (2022)Convolutional Neural Network for Freight Train Information Recognition., , and . ICMLC, page 167-171. ACM, (2017)On the convergence of an inexact Newton-type method., and . Oper. Res. Lett., 34 (6): 647-652 (2006)A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors., , , and . J. Glob. Optim., 87 (2): 405-422 (November 2023)Semismooth Newton Methods for Solving Semi-Infinite Programming Problems., , and . J. Glob. Optim., 27 (2-3): 215-232 (2003)Cube Theory and Stable k -Error Linear Complexity for Periodic Sequences., , and . Inscrypt, volume 8567 of Lecture Notes in Computer Science, page 70-85. Springer, (2013)Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations., , , and . SIAM J. Optimization, 22 (3): 987-1008 (2012)