Talk:Deterministic global optimization
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Deterministic vs Stochactic
editThe definition given here is restricted to mathematical programming. However, in practice, deterministic is often opposed to stochastic. See for example https://www4.stat.ncsu.edu/~gross/BIO560%20webpage/slides/Jan102013.pdfMClerc (talk) 20:14, 3 June 2019 (UTC) https://en.wikipedia.org/wiki/Deterministic_algorithm
From this point of view, if you run a given algorithm, again and again, and if the result is always the same, it is called deterministic. This is of course the case in mathematical programming, but such a definition is more general. For example, even a "stochastic" algorithm is deterministic if it uses an algebraic random number generator whose seed is initialised to the same value before each run.MClerc (talk) 20:14, 3 June 2019 (UTC)
Additional Deterministic global optimization solvers
editIs there any reason for additional global solvers to not be included on this list? The lp_solve software is a relatively complete implementation under a GNU Lesser General Public License which has contributing authors from MIT and the Naval Post Graduate school. Support in multiple computing languages such as R and Python via packages is also widely available. The software itself is hosted on sourceforge at 'http://lpsolve.sourceforge.net/5.5/'. — Preceding unsigned comment added by Ddashizzle (talk • contribs) 15:20, 21 January 2021 (UTC)
Lossless Convexification
editWould a section on the subject be appropriate here? Or at least somewhere nearby? Or somewhere on Wikipedia? There are lots of papers on it (not just Blackmore's). The possible applications seem like they should go far beyond optimal control.
http://larsblackmore.com/losslessconvexification.htm
I'm not qualified to write it myself. John G Hasler (talk) 14:08, 14 August 2021 (UTC) John G Hasler (talk) 14:12, 14 August 2021 (UTC)