On the polynomial solvability of distributionally robust k-sum optimization

DOI10.1080/10556788.2016.1215447zbMATH Open1384.90082OpenAlexW2482683034MaRDI QIDQ4594829FDOQ4594829

Authors: Anulekha Dhara, Karthik Natarajan 

Publication date: 24 November 2017

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1215447

Recommendations

• Distributionally robust optimization with polynomial densities: theory, models and algorithms
• Distributionally robust optimization and its tractable approximations
• Distributionally Robust Convex Optimization
• Distributionally robust possibilistic optimization problems
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions
• An Approximation Scheme for Distributionally Robust Nonlinear Optimization
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Distributionally robust optimization. A review on theory and applications
• Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
• A distributional interpretation of robust optimization

zbMATH Keywords

robust optimizationdistributions\(k\) sum optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Cited In (3)

• Bridging \(k\)-sum and CVaR optimization in MILP
• Title not available (Why is that?)
• Distributionally robust optimization with polynomial densities: theory, models and algorithms

This page was built for publication: On the polynomial solvability of distributionally robust k-sum optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594829)