Ill-Posed

Non-convex quadratic optimization problems

Among continuous optimization problems, convex problems (with convex objectives and convex constraints) define a class that can be solved efficiently with a variety of algorithms and with arbitrary precision. This is not true more generally when the convexity assumption is removed (see this post). This of course does not mean that (1) nobody should attempt...

blog — Francis Bach
2 Feb 2023
#optimization #non-convex-optimization #convex-analysis

Announcing an automatic theorem proving project

I am very happy to say that I have recently received a generous grant from the Astera Institute to set up a small group to work on automatic theorem proving, in the first instance for about three years after which we will take stock and see whether it is worth continuing. This will enable me […]

blog — Gowers's Weblog
28 Apr 2022
#ai-mathematics #mathematical-research #automated-theorem-proving
← newerpage 19 of 19