Approximating a solution that doesn't exist (2009)
johndcook.com
johndcook.com
Anyway, I work on optimization solvers and this is a big deal since there's always a question in whether or not the problem we pose can really be solved. Numerically, the solver can churn forever and maybe it's just hard, or maybe there's no solution. Outside of LPs, it's really hard to tell. Even convexity isn't enough for a solution. For example, min exp(-x) doesn't exist even though exp(-x) is strictly convex. There's an infimum, however.
Mostly, this is a way to say that I agree that the theory matters. I like the book above for establishing these conditions in optimization.
Edit 1: Does anyone know a good, nonnonsense book for establishing similar conditions for either ODEs or PDEs? In case it matters, I prefer looking at things from a general functional analysis/operator point for a view.
How is it compared to the Boyd and Vandenberghe?
I found this curious, it seemed obvious from the equation there is going to be a problem. If you think about it, u'=u^2+1 has the solution tan (up to some constants), which is singular. So a function that satisfies y'=y^2+t^2 will satisfy y'>u' for t>1, and so should also have a singularity, you just don't quite know where it's going to be.
He drew the exact opposite of the conclusion I see here. This seems like the perfect example for arguing why theory isn't important. Anybody who knows nothing about the theory could still tell that there's no solution -- precisely because of the very observation that lowering the step size (error tolerance) doesn't stabilize the graph and keeps causing larger and larger changes. If you had a solution, lowering the step size would eventually make a vanishingly small difference, and it's clearly doing the opposite. You don't need Picard–Lindelöf to tell you that.
dy/dt = y(t)^2; y(0)=1
has the solution y = 1/(1-x)
1/(1-t), not 1/(1-x), right?