Feasibility pump algorithm for sparse representation under Laplacian noise

DOI10.1155/2019/5615243zbMath1435.90089OpenAlexW2917567606MaRDI QIDQ2298553

Bogdan Dumitrescu, Florin Ilarion Miertoiu

Publication date: 20 February 2020

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

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)

Related Items (1)

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

Uses Software

• FEASPUMP

Cites Work

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

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