Concave Minimization for Sparse Solutions of Absolute Value Equations

Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the as...

Full description

Saved in:
Bibliographic Details
Published in:Transactions of Tianjin University 2016-02, Vol.22 (1), p.89-94
Main Author: 刘晓红 樊婕 李文娟
Format: Article
Language:English
Subjects:
Engineering
Humanities and Social Sciences
Mechanical Engineering
multidisciplinary
Science
凹函数
数值实验
方程
疏解
空间属性
线性规划问题
绝对值
连接矩阵
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the assumption that the connected matrixes have range space property（RSP）. Numerical experiments are also conducted to verify the efficiency of the proposed algorithm.
ISSN:1006-4982
1995-8196
DOI:10.1007/s12209-016-2640-z