Log in to save to my catalogue

Linear-step solvability of some folded concave and singly-parametric sparse optimization problems

Linear-step solvability of some folded concave and singly-parametric sparse optimization problems

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2788158331

Linear-step solvability of some folded concave and singly-parametric sparse optimization problems

About this item

Full title

Linear-step solvability of some folded concave and singly-parametric sparse optimization problems

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

Mathematical programming, 2023-04, Vol.198 (2), p.1339-1380

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

This paper studies several versions of the sparse optimization problem in statistical estimation defined by a pairwise separation objective. The sparsity (i.e.,

0
) function is approximated by a folded concave function; the pairwise separation gives rise to an objective of the Z-type. After presenting several realistic estimation problem...

Alternative Titles

Full title

Linear-step solvability of some folded concave and singly-parametric sparse optimization problems

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2788158331

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2788158331

Other Identifiers

ISSN

0025-5610

E-ISSN

1436-4646

DOI

10.1007/s10107-021-01766-4

How to access this item