On optimal zero-preserving corrections for inconsistent linear systems
From MaRDI portal
Publication:1041447
DOI10.1007/s10898-009-9403-5zbMath1180.90304OpenAlexW2129479713WikidataQ59140348 ScholiaQ59140348MaRDI QIDQ1041447
Luís M. Fernandes, Hanif D. Sherali, Paula Amaral, Joaquim Joao Júdice
Publication date: 2 December 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9403-5
Related Items
K-best feasible clusters - ranking optimal solutions from an infeasible LP, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, Optimal correction of infeasible equations system as Ax + B|x|= b using ℓ p-norm regularization, Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems, Optimal correction of the absolute value equations, On the optimal correction of infeasible systems of linear inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Irreducibly inconsistent systems of linear inequalities
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- MINOS(IIS): Infeasibility analysis using MINOS
- Some results concerning post-infeasibility analysis
- Some perturbation theory for linear programming
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Consistency, redundancy, and implied equalities in linear systems
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A framework for optimal correction of inconsistent linear constraints
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- The global solver in the LINDO API
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Approaches to Diagnosing Infeasible Linear Programs
- INCONSISTENT STRUCTURES OF LINEAR SYSTEMS
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- An LP-based algorithm for the correction of inconsistent linear equation and inequality systems
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Enhancements of ANALYZE
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Nonlinear Programming
- An Algorithm for Separable Nonconvex Programming Problems
- Introduction to global optimization.
