default search action
Meixia Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Meixia Lin, Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
A highly efficient algorithm for solving exclusive lasso problems. Optim. Methods Softw. 39(3): 489-518 (2024) - [j7]Zhenning Cai
, Bo Lin, Meixia Lin:
A Positive and Moment-Preserving Fourier Spectral Method. SIAM J. Numer. Anal. 62(1): 273-294 (2024) - [c3]Meixia Lin, Yangjing Zhang:
DNNLasso: Scalable Graph Learning for Matrix-Variate Data. AISTATS 2024: 316-324 - [i6]Meixia Lin, Yangjing Zhang:
DNNLasso: Scalable Graph Learning for Matrix-Variate Data. CoRR abs/2403.02608 (2024) - 2023
- [i5]Zhenning Cai, Bo Lin, Meixia Lin:
A positive and moment-preserving Fourier spectral method. CoRR abs/2304.11847 (2023) - [i4]Chengjing Wang, Peipei Tang, Wenling He, Meixia Lin:
Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm. CoRR abs/2308.08852 (2023) - 2022
- [j6]Meixia Lin
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems. Math. Program. Comput. 14(2): 223-270 (2022) - [j5]Junmao Zhang
Long-Term Spatiotemporal Characteristics and Impact Factors of Land Surface Temperature of Inhabited Islands with Different Urbanization Levels. Remote. Sens. 14(19): 4997 (2022) - [j4]Subhroshekhar Ghosh
Signal Analysis via the Stochastic Geometry of Spectrogram Level Sets. IEEE Trans. Signal Process. 70: 1104-1117 (2022) - 2021
- [j3]Meixia Lin
Quantitatively Assessing Ecological Stress of Urbanization on Natural Ecosystems by Using a Landscape-Adjacency Index. Remote. Sens. 13(7): 1352 (2021) - [c2]Pengfei Liu, Lishuang Dong, Xuebin Shao, Meixia Lin, Yangyang Gu, Xintian Hou:
Research on the development trend of vehicle operating system in China. CONF-CDS 2021: 30:1-30:6 - [c1]Rémi Bardenet, Subhroshekhar Ghosh, Meixia Lin:
Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGD. NeurIPS 2021: 16226-16237 - [i3]Subhroshekhar Ghosh, Meixia Lin, Dongfang Sun:
Estimation and inference of signals via the stochastic geometry of spectrogram level sets. CoRR abs/2105.02471 (2021) - [i2]Rémi Bardenet, Subhroshekhar Ghosh, Meixia Lin:
Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGD. CoRR abs/2112.06007 (2021)
2010 – 2019
- 2019
- [j2]Yunfeng Chen, Hui-Huang Lin, Linlin Huang, Zhi-Yun Lai, You-Zhi Hong, Meixia Lin, Yi-Ming Zeng
Analysis of Occlusive Endobronchial Stent for Prohibiting Life-Threatening Hemorrhage. J. Medical Imaging Health Informatics 9(5): 898-903 (2019) - [j1]Meixia Lin
Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem. SIAM J. Optim. 29(3): 2026-2052 (2019) - [i1]Yancheng Yuan, Meixia Lin, Defeng Sun, Kim-Chuan Toh:
On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models. CoRR abs/1902.00151 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: