arrow
返回

A bilinear formulation for vector sparsity optimization

delete2008-02-01
delete47
PRE
AI
R
Ron Meir
DOI:10.1016/j.sigpro.2007.08.015delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Sparsity plays an important role in many fields of engineering. The cardinality penalty function, often used as a measure of sparsity, is neither continuous nor differentiable and therefore smooth optimization algorithms cannot be applied directly. In this paper we present a continuous yet non-differentiable sparsity function which constitutes a tight lower bound on the cardinality function. The novelty of this approach is that we cast the problem of minimizing the new sparsity function as a problem with a bilinear objective function. We present a numerical comparison to other sparsity encouraging penalty functions for several applications. Additionally, we apply the techniques developed to minimize an objective function with a truncated hinge loss function. We present highly competitive results for all of the applications. (c) 2007 Elsevier B.V. All rights reserved.
Keyword:
sparsity
indefinite quadratic programming
regression
total variation
pattern classification
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Signal Processing 封面图
Signal Processing
IF:
3.6
论文数:
9.9K
被引数:
1.7W

机构

暂无机构信息
引用论文

引用论文

The Discrete Ordered Median Problem
err2003-01-01
err0
PREAI
errPatricia Domínguez-Marín
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容