Min-max and robust polynomial optimization
From MaRDI portal
Publication:652661
DOI10.1007/S10898-010-9628-3zbMath1230.90194OpenAlexW2086455601WikidataQ93624089 ScholiaQ93624089MaRDI QIDQ652661
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9628-3
Related Items (8)
The saddle point problem of polynomials ⋮ Robust feasibility of systems of quadratic equations using topological degree theory ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Recent advances in robust optimization: an overview ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ An interval branch and bound method for global robust optimization ⋮ Outer approximation for mixed-integer nonlinear robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for the global optimization of a class of continuous minimax problems
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Robust global optimization with polynomials
- Global Optimization with Polynomials and the Problem of Moments
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- Robust Optimization for Unconstrained Simulation-Based Problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: Min-max and robust polynomial optimization
