Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1436-4646
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets ; day:25 ; month:1 ; year:2020 ; pages:1-41
Mathematical programming ; (25.1.2020), 1-41
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-020-01468-3
- URN
-
urn:nbn:de:101:1-2020041901330375167347
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:44 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Slot, Lucas
- Laurent, Monique
- SpringerLink (Online service)
Ähnliche Objekte (12)
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Error bounds and convergence of proximal methods for composite minimization
Polynomial Treedepth Bounds in Linear Colorings
Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
Solving Degree Bounds for Iterated Polynomial Systems
Fast greedy $$\mathcal C}$$ C -bound minimization with guarantees
On the polynomial time bounded measure of degrees
Global convergence of model function based Bregman proximal minimization algorithms
Global convergence of model function based Bregman proximal minimization algorithms
Convergent upper bounds in global minimization with nonlinear equality constraints
Convergence bounds for empirical nonlinear least-squares
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Error bounds and convergence of proximal methods for composite minimization
Polynomial Treedepth Bounds in Linear Colorings
Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
Solving Degree Bounds for Iterated Polynomial Systems
Fast greedy $$\mathcal C}$$ C -bound minimization with guarantees
On the polynomial time bounded measure of degrees
Global convergence of model function based Bregman proximal minimization algorithms
Global convergence of model function based Bregman proximal minimization algorithms
Convergent upper bounds in global minimization with nonlinear equality constraints
Convergence bounds for empirical nonlinear least-squares
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Error bounds and convergence of proximal methods for composite minimization
Polynomial Treedepth Bounds in Linear Colorings
Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
Solving Degree Bounds for Iterated Polynomial Systems
Fast greedy $$\mathcal C}$$ C -bound minimization with guarantees
On the polynomial time bounded measure of degrees
Global convergence of model function based Bregman proximal minimization algorithms
Global convergence of model function based Bregman proximal minimization algorithms
Convergent upper bounds in global minimization with nonlinear equality constraints