Extending linear relaxation for non-square matrices and soft constraints

DOI10.1016/J.CAM.2016.05.006zbMATH Open1346.65013OpenAlexW2411768448MaRDI QIDQ738985FDOQ738985

Johannes Müller, M. Asif Naeem, Noreen Jamil, G. 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

Recommendations

• A Mathematical Model for the Motion of a Towed Pipeline Bundle
• Hildreth's algorithm with applications to soft constraints for user interface layout
• scientific article; zbMATH DE number 2080309
• scientific article; zbMATH DE number 24371
• Relaxation methods for solving linear inequality systems: converging results

zbMATH Keywords

convergencealgorithmlinear 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)

Cites Work

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

Cited In (3)

• A Mathematical Model for the Motion of a Towed Pipeline Bundle
• A refinement of an iterative orthogonal projection method
• A new iterative method for solving non-square systems of linear equations

Uses Software

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

This page was built for publication: Extending linear relaxation for non-square matrices and soft constraints

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