Sparse identification of posynomial models
From MaRDI portal
Publication:894327
DOI10.1016/j.automatica.2015.06.003zbMath1326.93028arXiv1311.4362OpenAlexW617472510MaRDI QIDQ894327
Carlo Novara, Laurent M. El Ghaoui, Giuseppe Carlo Calafiore
Publication date: 30 November 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.4362
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Parametric identification of structured nonlinear systems
- On general minimax theorems
- Elastic-net regularization in learning theory
- Elementary proof for Sion's minimax theorem
- Least angle regression. (With discussion)
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Safe Feature Elimination in Sparse Supervised Learning
- Regularization and Variable Selection Via the Elastic Net
- Digital Circuit Optimization via Geometric Programming
- Sparse Identification of Nonlinear Functions and Parametric Set Membership Optimality Analysis
- Geometric Programming for Communication Systems
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Sparse identification of posynomial models
