We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Saddle Point Problems of Polynomials

00:00
Abspielgeschwindigkeit
1
Untertitel
Aus
Abspielgeschwindigkeit
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Qualität
576p
1
 Zitieren
 Teilen
 Zugehöriges Material
 Herunterladen Bestellen
Kein Logo verfügbarBanff International Research Station (BIRS) for Mathematical Innovation and Discovery
 Nie, Jiawang

Formale Metadaten

Titel
Saddle Point Problems of Polynomials
Alternativer Titel
The Saddle Point Problem of Polynomials
Serientitel
Anzahl der Teile
24
Autor
Lizenz
CC-Namensnennung - keine kommerzielle Nutzung - keine Bearbeitung 4.0 International:
Sie dürfen das Werk bzw. den Inhalt in unveränderter Form zu jedem legalen und nicht-kommerziellen Zweck nutzen, vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
Identifikatoren
Herausgeber
Erscheinungsjahr
Sprache

Inhaltliche Metadaten

Fachgebiet
Genre
Abstract
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points, based on Lasserre's hierarchy of Moment-SOS relaxations. Under some genericity assumptions, we show that: i) if there exists a saddle point, the algorithm can get one by solving a finite number of relaxations; ii) if there is no saddle point, the algorithm can detect its nonexistence.
Geometry of Real Polynomials, Convexity and Optimization (19w5180)11 / 24
1
Vorschaubild
32:44
SAGE certificates for signomial and polynomial nonnegativity
2
Vorschaubild
28:21
Optimization over the Hypercube via Sums of Nonnegative Circuit Polynomials
3
Vorschaubild
55:16
Stable polynomials, Lorentzian polynomials and discrete convexity
4
Vorschaubild
32:41
Counting zeroes of polynomials in quadrature domains
5
Vorschaubild
36:15
Quantative Fundamental Theorem of Algebra
6
Vorschaubild
35:19
Positive integral kernels for polar derivatives
7
Vorschaubild
1:05:55
From finite to infinite dimensional moment problems
8
Vorschaubild
25:41
Tractable semi-algebraic approximation using Christoffel-Darboux kernel
9
Vorschaubild
29:44
Solving non-linear PDEs with the Lasserre hierarchy
10
Vorschaubild
58:11
Graph Density Inequalities & Sums of Squares
11
Vorschaubild
33:27
Saddle Point Problems of Polynomials
12
Vorschaubild
30:13
On sum of squares representation of convex forms and generalized Cauchy-Schwarz inequalities
13
Vorschaubild
30:18
Algorithms to compute topological invariants of symmetric semi algebraic sets
14
Vorschaubild
39:23
A framework for applying subgradient methods
15
Vorschaubild
1:09:55
From Counting to Optimization and Back using Geometry of Polynomials
16
Vorschaubild
29:47
Kippenhahn’s Theorem for the joint numerical range
17
Vorschaubild
27:55
Sums of squares and quadratic persistence
18
Vorschaubild
34:55
Vandermonde varieties, mirrored spaces, and cohomology of symmetric semi-algebraic sets
19
Vorschaubild
31:53
Noncommutative polynomials describing convex sets
20
Vorschaubild
35:32
Limitations on the expressive power of convex cones without long chains of faces
21
Vorschaubild
1:09:23
Hyperbolicity, stability, and determinantal representations
22
Vorschaubild
34:41
When is the conic hull of a curve a hyperbolicity cone?
23
Vorschaubild
31:04
Conic programming: infeasibility certificates and projective geometry
24
Vorschaubild
32:05
The moment problem for the algebra of symmetric tensors