Fields Institute Workshop on Validated Optimization

Workshop entry page: www.fields.toronto.edu/programs/scientific/01-02/numerical/optimization Fields' spiral staircase

These are photos taken of the blackboards after our lectures.

 
Workshop participants
Workshop participants
At Fields: Mobile
At Fields: Stairs
At Fields: Stairs
Raw schedule for the week
Topics gathered by cluster
Topics suggested by Ken, Ned, Natalie, Baker
Topics suggested by George, Tamás, Bill, Mihály
Topics suggested by Tibor, Petter, Vladik
Vladik - 1: Computing with probabilities
Vladik - 2: Computing with probabilities
Vladik - 3: Computing with probabilities
Vladik - 4: Computing with probabilities
Vladik - 5: Computing with probabilities
Vladik - 6: Computing with probabilities
Vladik - 7: Computing with probabilities
Vladik - 8: Computing with probabilities
Schedule for Tuesday - Range bounding & Taylor models
Tibor - 1: Bounding using Bernstein polynomials
Tibor - 2: Bounding using Bernstein polynomials
Tibor - 3: Bounding using Bernstein polynomials
Tibor - 4: Bounding using Bernstein polynomials
Tibor - 5: Bounding using Bernstein polynomials
Tibor - 6: Bounding using Bernstein polynomials - Open Questions
Natalie conjecture: Bounding using Bernstein polynomials
Mihály - 1: Packing circles in a square
Mihály - 2: Packing circles in a square
Martin - 1: Taylor model roundoff handling
Martin - 2: Taylor model roundoff handling
Martin - 3: Taylor model roundoff handling
Kyoko - 1: Taylor model roundoff handling
Schedule for Wednesday - Applications & Taylor Models
Mihály - 1: Packing circles in a square
Mihály - 2: Packing circles in a square
Mihály - 3: Packing circles in a square
Ned: TM of Ax = b; Reachability
George: All together for optimization of ODEs
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Ned: TM of Ax = b; Reachability
Martin - 1: Taylor model shrink wrapping
George: Shrink wrapping must be centered
Martin - 2: Linear Dominated Bounder Theorem
Kyoko - 1: Linear Dominated Bounder example
Schedule for Thursday - Techniques for Validated Optimization
Tibor - 1: Integration of tools
Tibor - 2: Integration of tools
Baker/Martin discussion
George: Randomization in a global optimization algorithm
Natalie - 1: Multiprecision interval arithmetic
Natalie - 2: Multiprecision interval arithmetic
Natalie - 3: Multiprecision interval arithmetic
Natalie - 4: Multiprecision interval arithmetic
Baker - 1: Nonlinear mini-max
Baker - 2: Nonlinear mini-max
Baker - 3: Nonlinear mini-max
Bill - 1: Big boxes; Overdetermined systems
Bill - 2: Big boxes; Overdetermined systems
Bill - 3: Big boxes; Overdetermined systems
Schedule for Friday - Applications
Kyoko & Martin - 1: Taylor models for x' = A x
Kyoko & Martin - 2: Taylor models for x' = A x
Kyoko & Martin - 3: Taylor models for x' = A x
Kyoko & Martin - 4: Taylor models for x' = A x
Kyoko & Martin - 5: Taylor models for x' = A x
Kyoko & Martin - 3A: Taylor models for x' = A x
Kyoko & Martin - 5A: Taylor models for x' = A x
Kyoko & Martin - 6: Taylor models for x' = A x
Kyoko & Martin - 2A: Taylor models for x' = A x
Kyoko & Martin - 8: Taylor models for x' = A x
Kyoko & Martin - 9: Taylor models for x' = A x
Baker - 1: GlobSol and Peeling
Baker - 2: GlobSol and Peeling
Baker - 3: GlobSol and Peeling
Baker - 4: GlobSol and Peeling
Baker - 5: GlobSol and Peeling
George: Neural Networks
Petter - 1: Financial applications
Petter - 2: Financial applications
Petter - 3: Financial applications
Petter - 4: Financial applications
Jeff - 1: GrafEq
Jeff - 2: GrafEq
Jeff - 3: GrafEq
Jeff - 4: GrafEq
Jeff - 5: GrafEq
Jeff - 6: GrafEq
Jeff - 7: GrafEq
Natalie - 1: Demo
Natalie - 2: Demo
Baker - 1: GlobSol
Baker - 2: GlobSol
Bill - 1: Csets
Bill - 2: Csets
Bill - 3: Csets
Bill - 4: Csets
Bill - 5: Csets
Bill - 6: Csets
Bill - 7: Csets
Bill - 8: Csets

 

Photos by Baker Kearfott
Originals (directory)