Get started
Author

Meixia Lin

Observed name: Lin, Meixia
ORCID: 0000-0002-9787-8586
Observed ORCID: 0000-0002-9787-8586
OpenAlex ID: A5042756211
Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
2019 · Meixia Lin, Yong-Jin Liu, et al. · SIAM Journal on Optimization · 35
PDF
Signal Analysis via the Stochastic Geometry of Spectrogram Level Sets
2022 · Subhroshekhar Ghosh, Meixia Lin, et al. · IEEE Transactions on Signal Processing · 10
PDF
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
2021 · Meixia Lin, Defeng Sun, et al. · Mathematical Programming Computation · 7
PDF
Efficient algorithms for multivariate shape-constrained convex regression problems
2020 · Lin, Meixia, Sun, Defeng, et al. · arXiv (Cornell University) · 7
PDF
A Positive and Moment-Preserving Fourier Spectral Method
2024 · Zhenning Cai, Bo Lin, et al. · SIAM Journal on Numerical Analysis · 5
PDF
Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models
2020 · Lin, Meixia, Yuan, Yancheng, et al. · arXiv (Cornell University) · 3
PDF
Wasserstein Distributionally Robust Optimization and Its Tractable Regularization Formulation
2025 · Hong T. M. Chu, Meixia Lin, et al. · Journal of Optimization Theory and Applications · 2
A highly efficient algorithm for solving exclusive lasso problems
2023 · Meixia Lin, Yancheng Yuan, et al. · Optimization methods & software · 2
PDF
Estimation of sparse Gaussian graphical models with hidden clustering structure
2020 · Lin, Meixia, Sun, Defeng, et al. · arXiv (Cornell University) · 2
PDF
A dual Newton based preconditioned proximal point algorithm for exclusive lasso models
2019 · Lin, Meixia, Sun, Defeng, et al. · arXiv (Cornell University) · 2
PDF
Learning the Hub Graphical Lasso Model with the Structured Sparsity via an Efficient Algorithm
2025 · Chengjing Wang, Peipei Tang, et al. · Journal of Scientific Computing · 1
PDF
Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGD
2021 · Bardenet, Remi, Ghosh, Subhro, et al. · arXiv (Cornell University) · 1
PDF
An augmented Lagrangian method with constraint generations for shape-constrained convex regression problems
2020 · Meixia Lin, Defeng Sun, et al. · arXiv (Cornell University) · 1
Wasserstein distributionally robust optimization and its tractable regularization formulations
2024 · Chu, Hong T. M., Lin, Meixia, et al. · arXiv (Cornell University)
PDF
Estimation and inference of signals via the stochastic geometry of spectrogram level sets.
2021 · Subhroshekhar Ghosh, Meixia Lin, et al. · arXiv (Cornell University)
On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models.
2019 · Yancheng Yuan, Meixia Lin, et al. · arXiv (Cornell University)
Efficient sparse Hessian based algorithms for the clustered lasso problem
2018 · Meixia Lin, Yong‐Jin Liu, et al. · arXiv (Cornell University)
Works count: 17
Citation count: 78
H-index: 5
I10-index: 2
Year
Topic
Type