From f0858bc261887135ab8017556cc2eb28e4d6f380 Mon Sep 17 00:00:00 2001 From: Glen Whitney Date: Wed, 28 Feb 2024 23:59:06 +0000 Subject: [PATCH] Update Engine prototype --- Engine-prototype.md | 1 + 1 file changed, 1 insertion(+) diff --git a/Engine-prototype.md b/Engine-prototype.md index 8a8310e..99bcdf3 100644 --- a/Engine-prototype.md +++ b/Engine-prototype.md @@ -56,6 +56,7 @@ Some of these are obvious, but we may as well write them down. Note we may want * Since generally speaking, at least for most of the starting list of constraints, each constraint is quadratic, there _might_ be some useful information here * [Paper on deciding the existence of solutions](http://arxiv.org/abs/2106.08119) * [Relevant Math.StackExchange question](https://math.stackexchange.com/questions/2119007/how-do-you-solve-a-system-of-quadratic-equations) +* If say we are seeking the closest satisfying point to some input, it might be that we are trying to minimize a nonnegative polynomial, and then some of the information at https://en.wikipedia.org/wiki/Positive_polynomial might be relevant. Feel free to add in other ideas in any of these categories.