Certificates of infeasibility via nonsmooth optimization
Hannes Fendl, Arnold Neumaier, Hermann Schichl
TL;DR
This paper introduces a method to certify infeasibility of certain regions in constraint satisfaction problems using nonsmooth optimization, enabling the identification and enlargement of exclusion boxes.
Contribution
It presents a novel certificate of infeasibility based on nonsmooth optimization and demonstrates how to enlarge exclusion boxes for better problem solving.
Findings
Certificate effectively identifies infeasible regions.
Method allows enlargement of exclusion boxes.
Applicable to constraint satisfaction problems.
Abstract
An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a nonlinearly constrained nonsmooth optimization problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Constraint Satisfaction and Optimization · Optimization and Packing Problems