Year 2000 problem | Search engine optimization | Waring's problem | The Final Problem | The Problem with Popplers | Multidisciplinary design optimization | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Sum-of-squares optimization | Species problem | search engine optimization (SEO) | search engine optimization | problem solving | Problem gambling | Packing problem | packing problem | Message Transmission Optimization Mechanism | Combinatorial optimization | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem | WAN optimization | Undecidable problem | Travelling salesman problem | travelling salesman problem |
The cavity method has played and is playing a major role in the solution of optimization problems like the K-satisfiability and the graph coloring in present days.
A model function is determined by interpolating the objective function at (an integer between and ) points; the remaining freedom, if any, is taken up by minimizing the Frobenius norm of the change to the model's Hessian (with respect to the last iteration).