Feasibility pump algorithm for sparse representation under Laplacian noise

DOI10.1155/2019/5615243MaRDI QIDQ2298553zbMATH OpenOpenAlexFDO

Authors Florin Ilarion Miertoiu, B. Dumitrescu

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/5615243

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: The Feasibility Pump is an effective heuristic method for solving mixed integer optimization programs. In this paper the algorithm is adapted for finding the sparse representation of signals affected by Laplacian noise. Two adaptations of the algorithm, regularized and nonregularized, are proposed, tested, and compared against the regularized least absolute deviation (RLAD) model. The obtained results show that the addition of the regularization factor always improves the algorithm. The regularized version of the algorithm also offers better results than the RLAD model in all cases. The Feasibility Pump recovers the sparse representation with good accuracy while using a very small computation time when compared with other mixed integer methods.

Recommendations

• A New Approach to the Feasibility Pump in Mixed Integer Programming
• Improving the feasibility pump
• A feasibility pump for mixed integer nonlinear programs
• The feasibility pump
• Feasibility Pump-like heuristics for mixed integer problems

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A feasibility pump heuristic for general mixed-integer problems
• A New Approach to the Feasibility Pump in Mixed Integer Programming
• A storm of feasibility pumps for nonconvex MINLP
• An Algorithm for the Traveling Salesman Problem
• An Automatic Method of Solving Discrete Programming Problems
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• Boosting the feasibility pump
• Cutting planes in integer and mixed integer programming
• Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
• Feasibility pump 2.0
• Feasibility Pump-like heuristics for mixed integer problems
• Improving the feasibility pump
• Improving the randomization step in feasibility pump
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• The feasibility pump
• Three ideas for a feasibility pump for nonconvex MINLP
• Using the analytic center in the feasibility pump

Cited in

(1)

• Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding

Describes a project that uses

Uses Software

• FEASPUMP

This page was built for publication: Feasibility pump algorithm for sparse representation under Laplacian noise

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