Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem.
Stéphane JacquetSylvain HalléPublished in: IFM (2020)
Keyphrases
- constrained optimization
- constrained optimization problems
- penalty function
- objective function
- satisfiability problem
- unconstrained optimization
- sat solvers
- constraint handling
- search algorithm
- lagrange multipliers
- inequality constraints
- penalty functions
- augmented lagrangian
- phase transition
- max sat
- k means
- neural network
- stationary points
- interval analysis