almost stochastic

annals of computational statistics

  • home
  • about
  • archive
  • toolbox
  • notebooks
  • short notes
  • contact
skip to main | skip to sidebar

2016/09/23

A simple bound for optimisation using a grid

If I give you a function on $[0,1]$ and a computer and want you to find the minimum, what would you do? Since you have the computer, you can be lazy: Just compute a grid on $[0,1]$, evaluate the grid points and take the minimum. This will give you something close to the true minimum. But how much?
Read more »
author: Deniz on Friday, September 23, 2016 1 comments
categories: optimization
Newer Posts Older Posts Home
my personal webpage.

rss

Posts
Atom
Posts
All Comments
Atom
All Comments

search

mathematics village

archive

  • ►  2020 (1)
    • ►  November 2020 (1)
  • ►  2019 (1)
    • ►  June 2019 (1)
  • ▼  2016 (3)
    • ►  October 2016 (1)
    • ▼  September 2016 (1)
      • A simple bound for optimisation using a grid
    • ►  January 2016 (1)
  • ►  2015 (2)
    • ►  March 2015 (2)
  • ►  2014 (2)
    • ►  June 2014 (2)
  • ►  2013 (10)
    • ►  November 2013 (2)
    • ►  August 2013 (1)
    • ►  July 2013 (2)
    • ►  June 2013 (1)
    • ►  May 2013 (4)

band pass filter

analysis (2) bayesian statistics (2) chaos (1) dynamical systems (2) inequalities (1) inverse problems (1) linear algebra (1) machine learning (3) matrix factorizations (1) maximum-likelihood (4) measure theory (2) monte carlo methods (5) optimization (5) probability (2) sequential monte carlo (1) stochastic differential equations (1) stochastic filtering (1) time series analysis (3)

links

  • I'm a bandit
  • Math ∩ Programming
  • Non-Elephant Dynamics
  • Tricki
  • Xi'an's Og
Powered by Blogger.
 
"There are some enterprises in which a careful disorderliness is the true method." (Moby Dick, chapter 82)
by Ömer Deniz Akyıldız.