Lingchen Kong

Biao Qu

J. Optim. Theory Appl., March, 2023

An Enhanced Regularized Clustering Method With Adaptive Spurious Connection Detection.

[BibT_eX]

[DOI]

IEEE Signal Process. Lett., 2023

Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications.

[BibT_eX]

[DOI]

Jun Sun

Shenglong Zhou

J. Comput. Appl. Math., 2023

2022

Fast Algorithms for LS and LAD-Collaborative Regression.

[BibT_eX]

[DOI]

Jun Sun

Mei Li

Asia Pac. J. Oper. Res., December, 2022

A Safe Feature Screening Rule for Rank Lasso.

[BibT_eX]

[DOI]

Pan Shang

Dashuai Liu

IEEE Signal Process. Lett., 2022

Nonconvex clustering via ℓ0 fusion penalized regression.

[BibT_eX]

[DOI]

Huangyue Chen

Yan Li

Pattern Recognit., 2022

$\ell _{1}$ℓ1-Norm Quantile Regression Screening Rule via the Dual Circumscribed Sphere.

[BibT_eX]

[DOI]

Pan Shang

IEEE Trans. Pattern Anal. Mach. Intell., 2022

2021

Data-Driven Process Monitoring Using Structured Joint Sparse Canonical Correlation Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2021

ℓ2, 0-norm based selection and estimation for multivariate generalized linear models.

[BibT_eX]

[DOI]

Yang Chen

Ziyan Luo

J. Multivar. Anal., 2021

Regularization Parameter Selection for the Low Rank Matrix Recovery.

[BibT_eX]

[DOI]

Pan Shang

J. Optim. Theory Appl., 2021

Optimal portfolio selections via ℓ <sub>1, 2</sub>-norm regularization.

[BibT_eX]

[DOI]

Hongxin Zhao

Hou-Duo Qi

Comput. Optim. Appl., 2021

2020

tSSNALM: A fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

Safe feature screening rules for the regularized Huber regression.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2019

Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection.

[BibT_eX]

[DOI]

Chuanqi Qi

Hou-Duo Qi

IEEE Trans. Signal Process., 2019

The linearized alternating direction method of multipliers for sparse group LAD model.

[BibT_eX]

[DOI]

Huifang Wang

Jiyuan Tao

Optim. Lett., 2019

Nonconvex mixed matrix minimization.

[BibT_eX]

[DOI]

Math. Found. Comput., 2019

Alternating direction method of multipliers for nonconvex fused regression problems.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2019

Double fused Lasso penalized LAD for matrix regression.

[BibT_eX]

[DOI]

Mei Li

Appl. Math. Comput., 2019

2018

ADMM for High-Dimensional Sparse Penalized Quantile Regression.

[BibT_eX]

[DOI]

Technometrics, 2018

Iterative reweighted methods for $\ell _1-\ell _p$ minimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

Erratum to: Improved Complexity Analysis of Full Nesterov-Todd Step Feasible Interior-Point Method for Symmetric Optimization.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2017

2016

A note on an inequality involving Jordan product in Euclidean Jordan algebras.

[BibT_eX]

[DOI]

Guo-Qiang Wang

Jiyuan Tao

Optim. Lett., 2016

The Uniqueness and Greedy Method for Quadratic Compressive Sensing.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Data Science and Advanced Analytics, 2016

2015

Improved Complexity Analysis of Full Nesterov-Todd Step Feasible Interior-Point Method for Symmetric Optimization.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

2014

The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2014

2013

Exact Recovery for Sparse Signal via Weighted l_1 Minimization.

[BibT_eX]

[DOI]

CoRR, 2013

New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing.

[BibT_eX]

[DOI]

CoRR, 2013

Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2013

2012

Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.

[BibT_eX]

[DOI]

Math. Program., 2012

A semismooth Newton method for nonlinear symmetric cone programming.

[BibT_eX]

[DOI]

Qingmin Meng

Math. Methods Oper. Res., 2012

Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2012

Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays.

[BibT_eX]

[DOI]

Comput. Math. Methods Medicine, 2012

2011

Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2011

Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery

[BibT_eX]

[DOI]

CoRR, 2011

2009

Sufficiency of linear transformations on Euclidean Jordan algebras.

[BibT_eX]

[DOI]

Linxia Qin

Jiye Han

Optim. Lett., 2009

Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2009

2008

A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems.

[BibT_eX]

[DOI]

Jie Sun

SIAM J. Optim., 2008

The solution set structure of monotone linear complementarity problems over second-order cone.

[BibT_eX]

[DOI]

Jiye Han

Oper. Res. Lett., 2008

2007

New smooth C-functions for symmetric cone complementarity problems.

[BibT_eX]

[DOI]