Min-max and robust polynomial optimization
From MaRDI portal
Recommendations
- Robust global optimization with polynomials
- A ``joint+marginal approach in optimization
- A ``joint+marginal approach to parametric polynomial optimization
- An algorithm for semi-infinite polynomial optimization
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
Cites work
- scientific article; zbMATH DE number 837313 (Why is no real title available?)
- scientific article; zbMATH DE number 3394474 (Why is no real title available?)
- A ``joint+marginal approach to parametric polynomial optimization
- An algorithm for the global optimization of a class of continuous minimax problems
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- GloptiPoly 3: moments, optimization and semidefinite programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Robust global optimization with polynomials
- Robust optimization for unconstrained simulation-based problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Cited in
(18)- Robust feasibility of systems of quadratic equations using topological degree theory
- Tractable approximations of sets defined with quantifiers
- The saddle point problem of polynomials
- Min-max-min robust combinatorial optimization
- Outer approximation for mixed-integer nonlinear robust optimization
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
- Minimizer Extraction in Polynomial Optimization Is Robust
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust global optimization with polynomials
- Recent advances in robust optimization: an overview
- Sum-of-squares relaxations for polynomial min-max problems over simple sets
- Semidefinite programming for min-max problems and games
- A ``joint+marginal approach to parametric polynomial optimization
- scientific article; zbMATH DE number 2190135 (Why is no real title available?)
- A utopia point method-based robust vector polynomial optimization scheme
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A ``joint+marginal approach in optimization
- An interval branch and bound method for global robust optimization
This page was built for publication: Min-max and robust polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652661)
