Extending linear relaxation for non-square matrices and soft constraints

DOI10.1016/j.cam.2016.05.006zbMath1346.65013OpenAlexW2411768448MaRDI QIDQ738985

Johannes Müller, M. Asif Naeem, Noreen Jamil, Gerald Weber, Christof Lutteroth

Publication date: 16 August 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/51653/1/Extending_Linear_Relaxation_for_Non_Square_Matrices_and_Soft_Constraints.pdf

zbMATH Keywords

algorithmconvergencelinear relaxationsoft constraintsdeterministic pivot assignmentnon-square matricesrandom pivot assignmentuser interface (UI) layout

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items

A new iterative method for solving non-square systems of linear equations, A refinement of an iterative orthogonal projection method

Uses Software

• Matlab
• QOCA
• Skyblue
• MiniMaxSat
• linprog
• QUICKXPLAIN
• HiRise
• Cassowary

Cites Work

• Domain specific high-level constraints for user interface layout
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Misclassification minimization
• Current approaches for solving over-constrained problems
• A foundation of solution methods for constraint hierarchies
• Preconditioning techniques for large linear systems: A survey
• Hildreth's algorithm with applications to soft constraints for user interface layout
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Iterative least-squares solutions of coupled sylvester matrix equations
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
• Fast Heuristics for the Maximum Feasible Subsystem Problem
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Exploiting Cycle Structures in Max-SAT
• Algorithms for Weighted Boolean Optimization
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The Relaxation Method for Solving Systems of Linear Inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• Iterative Solution Methods
• Methods of conjugate gradients for solving linear systems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item