A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

From MaRDI portal
Publication:5245362

DOI10.1137/130925013zbMath1330.90119arXiv1306.3437OpenAlexW2128244396MaRDI QIDQ5245362

David Papp, Sanjay Mehrotra

Publication date: 8 April 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3437



Related Items

The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods, Robust portfolio optimization with respect to spectral risk measures under correlation uncertainty, Scenario reduction for stochastic programs with conditional value-at-risk, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Frameworks and results in distributionally robust optimization, Partition-based distributionally robust optimization via optimal transport with order cone constraints, Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets, A modified exchange algorithm for distributional robust optimization and applications in risk management, Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming, Distributionally robust expected residual minimization for stochastic variational inequality problems, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, Distributionally robust portfolio optimization with second-order stochastic dominance based on Wasserstein metric, Service center location problems with decision dependent utilities and a pandemic case study, Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints, A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Primal-dual hybrid gradient method for distributionally robust optimization problems, Distributionally robust optimization with decision dependent ambiguity sets, Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments, Robust decision making using a general utility set, Robust unit commitment with \(n-1\) security criteria, Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions, Discrete Approximation and Quantification in Distributionally Robust Optimization, Quantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints, Distributionally robust optimization. A review on theory and applications, An inexact primal-dual algorithm for semi-infinite programming, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets, Distributionally robust resource planning under binomial demand intakes, Variational Theory for Optimization under Stochastic Ambiguity, Quantitative stability analysis for minimax distributionally robust risk optimization


Uses Software