Hildreth's algorithm with applications to soft constraints for user interface layout

DOI10.1016/j.cam.2015.04.014zbMath1326.65068arXiv1409.2902OpenAlexW1976936504MaRDI QIDQ2351069

Noreen Jamil, Xuemei Chen, Alexander Cloninger

Publication date: 22 June 2015

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

Full work available at URL: https://arxiv.org/abs/1409.2902

zbMATH Keywords

linear inequalitiessoft constraintsHildreth's algorithmUI layout

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical linear algebra (65F99)

Related Items

Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ The Kaczmarz algorithm, row action methods, and statistical learning algorithms ⋮ Extending linear relaxation for non-square matrices and soft constraints ⋮ Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms

Uses Software

• Matlab
• QOCA
• linprog
• HiRise
• Cassowary

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of Hildreth's quadratic programming algorithm
• Domain specific high-level constraints for user interface layout
• Randomized Kaczmarz solver for noisy linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• Misclassification minimization
• Preconditioning techniques for large linear systems: A survey
• Almost sure convergence of the Kaczmarz algorithm with random measurements
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• Randomized Extended Kaczmarz for Solving Least Squares
• Fast Heuristics for the Maximum Feasible Subsystem Problem
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Convergence of the cyclical relaxation method for linear inequalities
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• The Relaxation Method for Solving Systems of Linear Inequalities
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• Preserving Form-Features in Interactive Mesh Deformation