Shape constraints and algorithms

author: Arne Kovac, University of Bristol
published: Dec. 17, 2007,   recorded: September 2007,   views: 3214

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

We consider several problems in the areas of nonparametric regression and image analysis under shape constraints. The task is always to produce simple functions with small number of local extreme values, while multiresolution criteria ensure good approximation of the fitted functions. These strategies easily lead to minimisation problems that can be very difficult to solve, hence the design of efficient algorithms is crucial. One of the problems that we study is concerned with online data where fast processing is particularly important.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: