Все публикации

1:05:45

MoCaO Lectures 2024: Geometry and Convexity in Optimisation - Lecture 5 by Bruno Lourenco

1:07:27

MoCaO Lectures 2024: Geometry and Convexity in Optimisation - Lecture 4 by Isabelle Shankar

1:09:32

MoCaO Lectures 2024: Geometry and Convexity in Optimisation - Lecture 3 by Vera Roshchina

1:07:32

MoCaO Lectures 2024: Geometry and Convexity in Optimisation - Lecture 2 by Vera Roshchina

1:17:31

MoCaO Lectures 2024: Geometry and Convexity in Optimisation - Lecture 1 by Vera Roshchina

1:05:46

MoCaO Lectures 2023: Polynomial optimisation - Lecture 5 by Mareike Dressler

1:05:44

MoCaO Lectures 2023: Polynomial optimisation - Lecture 4 by Georgina Hall

1:03:20

MoCaO Lectures 2023: Polynomial optimisation - Lecture 3 by James Saunderson

1:03:01

MoCaO Lectures 2023: Polynomial optimisation - Lecture 2 by James Saunderson

1:14:40

MoCaO Lectures 2023: Polynomial optimisation - Lecture 1 by James Saunderson

1:19:02

MoCaO Lectures 2022: Data Science - Lecture 5 by Guoyin Li

0:50:32

MoCaO Lectures 2022: Data Science - Lecture 4 by Quoc Thong Le Gia

0:53:51

MoCaO Lectures 2022: Data Science - Lecture 3 by Stephen Wright

0:53:08

MoCaO Lectures 2022: Data Science - Lecture 2 by Stephen Wright

0:54:56

MoCaO Lectures 2022: Data Science - Lecture 1 by Stephen Wright

1:06:16

Didier Henrion: Solving numerically polynomial optimization problems

0:33:02

Evgeni Nurminski: Additional Cuts in Conjugate Epi Projection Algorithm

0:26:52

Dmitriy Drusvyatskiy: Active strict saddles in nonsmooth optimization

1:01:56

Claudia Sagastizábal: Exploiting structure in nonsmooth optimization past and present

0:38:01

Constantin Zalinescu: On unconstrained optimization problems solved using CDT and triality theory

0:34:10

Nir Sharon: Multiscale transform for scattered manifold valued data

0:34:04

Michel Théra: Old and new results on equilibrium and quasi equilibrium problems

0:35:14

Helmut Gfrerer: On a semismooth Newton method for generalized equations

0:26:33

Sorin-Mihai Grad: An extension of proximal point algorithms beyond convexity