Sparse regularization via bidualization

DOI10.1007/S10898-021-01089-WOpenAlexW3201965340MaRDI QIDQ2114593FDOQ2114593

Yehonathan Refael, Amir Beck

Publication date: 15 March 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01089-w

zbMATH Keywords

sparsityconvex envelopebiconjugaterandomized root search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Title not available (Why is that?)
• Support-vector networks
• Regularization and Variable Selection Via the Elastic Net
• Introduction to algorithms.
• First-Order Methods in Optimization
• Convex Analysis
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Proximité et dualité dans un espace hilbertien
• An O(n) algorithm for quadratic knapsack problems

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Sparse regularization via bidualization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114593)