A Laplacian approach to \(\ell_1\)-norm minimization

DOI10.1007/s10589-021-00270-xzbMath1473.90157arXiv1901.08836OpenAlexW3139482808MaRDI QIDQ2044482

Vincenzo Bonifaci

Publication date: 9 August 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationiteratively reweighted least squaresmultiplicative weightsbasis pursuit\(\ell_1 \) regressionLaplacian paradigm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Physarum-inspired multi-commodity flow dynamics ⋮ Fast Iterative Solution of the Optimal Transport Problem on Graphs

Uses Software

• PDCO
• PhaseMax

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A mathematical introduction to compressive sensing
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• The graphical lasso: new insights and alternatives
• An improved algorithm for basis pursuit problem and its applications
• A mathematical model for adaptive transport network in path finding by true slime mold
• Two results on slime mold computations
• Linear models and generalizations. Least squares and alternatives. With contributions by Michael Schomaker.
• Atomic Decomposition by Basis Pursuit
• Optimization with Sparsity-Inducing Penalties
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Runtime guarantees for regression problems
• Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Evolutionary Games and Population Dynamics
• PhaseMax: Convex Phase Retrieval via Basis Pursuit
• Natural Algorithms for Flow Problems
• First-Order Methods in Optimization
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications
• Towards a Stationary Monge--Kantorovich Dynamics: The Physarum Polycephalum Experience
• Advanced Time Series Data Analysis
• Hessian Riemannian Gradient Flows in Convex Programming
• On the Convergence Time of a Natural Dynamics for Linear Programming
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
• Minimizing Effective Resistance of a Graph
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Convex Analysis
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

This page was built for publication: A Laplacian approach to \(\ell_1\)-norm minimization