Min-max and robust polynomial optimization
type: Item
instance of: scholarly article
title: Min-max and robust polynomial optimization
zbMATH Open document ID: 1230.90194
published in: Journal of Global Optimization
publication date: 2011-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5988559
zbMATH Keywords: polynomial optimization
zbMATH Keywords: min-max optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: semidefinite relaxations
describes a project that uses: SeDuMi
describes a project that uses: GloptiPoly
author: Jean B. Lasserre
MaRDI profile type: Publication
full work available at URL: s10898-010-9628-3
OpenAlex ID: W2086455601
Wikidata QID: Q93624089
cites work: Q5662630
cites work: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
cites work: Robust Optimization for Unconstrained Simulation-Based Problems
cites work: GloptiPoly 3: moments, optimization and semidefinite programming
cites work: GloptiPoly
cites work: Q4863593
cites work: Global optimization with polynomials and the problem of moments
cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
cites work: Robust global optimization with polynomials
cites work: A “Joint+Marginal” Approach to Parametric Polynomial Optimization
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: An algorithm for the global optimization of a class of continuous minimax problems
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
DOI: 10.1007/S10898-010-9628-3
description: scientific article; zbMATH DE number 5988559