Polynomial and Moment Optimization in Julia and JuMP | JuliaCon 2019

preview_player
Показать описание
Polynomial and moment optimization problems are infinite dimensional optimization problems that can model a wide range of problems in engineering and statistics. In this minisymposium we show how the Julia and JuMP ecosystems are particularly well suited for the effortless construction of these problems and the development of state-of-the-art solvers for them.

Speakers:
- Tillmann Weisser
- Benoît Legat
- Chris Coey
- Lea Kapelevich
- Juan Pablo Vielma
  1. The Julia Programming Language
  2. high performance computing
  3. hpc
  4. parallel computing
  5. julia
  6. Julia
Рекомендации по теме
Polynomial and Moment 1:58:16

Polynomial and Moment Optimization in Julia and JuMP | JuliaCon 2019

Didier Henrion: Polynomial 1:01:19

Didier Henrion: Polynomial optimization with the Lasserre hierarchy

Sums of squares, 0:53:23

Sums of squares, moments and applications in polynomial optimization

LP, SOCP, and 0:31:55

LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization

Talk: Exact Moment 0:41:40

Talk: Exact Moment Representation in Polynomial Optimization by POEMA ESR9 - Lorenzo Baldi (Inria)

Didier Henrion: Solving 1:06:16

Didier Henrion: Solving numerically polynomial optimization problems

How REAL Men 0:00:35

How REAL Men Integrate Functions

Victor Magron : 1:29:06

Victor Magron : Exploiting sparsity in polynomial optimization Lecture 1

Olga Kuryatnikova: Polynomial 0:32:03

Olga Kuryatnikova: Polynomial Optimization

Tight Semidefinite Programming 0:42:29

Tight Semidefinite Programming Relaxations for Polynomial Optimization

'Polynomial Optimization' by 0:49:24

'Polynomial Optimization' by Olga Kuryatnikova with Q&A

Polynomial Optimization | 0:29:01

Polynomial Optimization | Benoît Legat | JuliaCon 2023

17June2022 Tutte An 0:59:41

17June2022 Tutte An introduction to Nonnegativity and Polynomial Optimization

Uncertainty Quantification of 0:54:22

Uncertainty Quantification of Nonlinear Systems

Polynomial Approximation on 0:02:42

Polynomial Approximation on Unbounded Subsets and the Moment Problem

CWI Lectures - 0:44:40

CWI Lectures - Amir Ali Ahmadi - Local Minima in Polynomial Optimization

Performance analysis of 1:16:40

Performance analysis of approximation hierarchies for polynomial optimization

Efficient non-convex polynomial 1:02:21

Efficient non-convex polynomial optimization and the sum-of-squares hierarchy - David Steurer

Polynomial, Moment and 0:48:42

Polynomial, Moment and SDP data - Victor Magron (LAAS- CNRS)

SIAM AG21Bounding the 0:25:59

SIAM AG21Bounding the Separable Rank of Linear Maps with Polynomial Optimization

This chapter closes 0:00:16

This chapter closes now, for the next one to begin. 🥂✨.#iitbombay #convocation

A QIG seminar 0:58:21

A QIG seminar on 'Approximating Polynomial Optimizations' by David Reeb

Bounding the Moments 0:03:10

Bounding the Moments of Polynomial Jump-Diffusion Processes |

Monique Laurent: Convergence 1:02:10

Monique Laurent: Convergence analysis of hierarchies for polynomial optimization