Full search page →

Supplementary notes

Optional notes for OPT 05 · Approximation, Statistical Estimation and Experiment Design, one page each. Nothing in the main text depends on them.

Navigate: this page and this track: Navigate: this page and this track

These notes are optional; the main estimation workflow does not depend on them.

  1. Logistic separation and finite estimates

    A convex likelihood can improve indefinitely along a parameter direction without having a finite minimizer.

References

  1. Stephen Boyd and Lieven Vandenberghe, Convex Optimization, Cambridge University Press, 2004. Reading: Chapter 6, Sections 6.1–6.5; Chapter 7, Sections 7.1–7.5. Official book, free PDF.

  2. SciPy developers, “scipy.optimize.minimize” and “scipy.optimize.minimize_scalar,” SciPy API documentation, accessed 2026. Multivariate interface, scalar interface.

  3. SciPy developers, “scipy.optimize.linprog,” SciPy API documentation, accessed 2026. Official documentation.

  4. Sebastian Pokutta, “The Frank-Wolfe Algorithm: A Short Introduction,” Jahresbericht der Deutschen Mathematiker-Vereinigung, 126, 2024. Open-access survey.

  5. Michael Schaller, Alberto Bemporad and Stephen Boyd, “Learning Parametric Convex Functions,” manuscript, 2025. Official manuscript page.

  6. SAS Institute, “Existence of Maximum Likelihood Estimates,” SAS/STAT 12.1 User’s Guide, accessed 2026-11-05. Official documentation.