A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set
From MaRDI portal
Publication:5110557
DOI10.1137/18M1186320zbMath1467.90016arXiv1805.03030MaRDI QIDQ5110557
Publication date: 20 May 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03030
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Local linear convergence for alternating and averaged nonconvex projections
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Some results concerning post-infeasibility analysis
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Fast Heuristics for the Maximum Feasible Subsystem Problem
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Approaches to Diagnosing Infeasible Linear Programs
- Variational Analysis
- Sparse Reconstruction by Separable Approximation
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Convex Analysis
This page was built for publication: A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set
