Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search

DOI10.1137/19M1281514zbMath1472.90102arXiv1903.05744OpenAlexW3181449900MaRDI QIDQ5003211

Jon Lee, Gabriel Ponte, Luze Xu, Márcia H. C. Fampa

Publication date: 20 July 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.05744

zbMATH Keywords

approximation algorithmgeneralized inversesparse optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Theory of matrix inversion and generalized inverses (15A09)

Related Items (2)

Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses ⋮ Experimental analysis of local searches for sparse reflexive generalized inverses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sparse reflexive generalized inverse
• The Design of Approximation Algorithms
• SparseX
• Sparse Approximate Solutions to Linear Systems
• Generalized Inverses of Linear Transformations

This page was built for publication: Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search