Tractable approximations to robust conic optimization problems
From MaRDI portal
Recommendations
Cites work
- A mathematical view of interior-point methods in convex optimization
- Characterization of the barrier parameter of homogeneous convex cones
- Constrained Stochastic LQC: A Tractable Approach
- Introduction to Stochastic Programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
Cited in
(61)- Robust binary optimization using a safe tractable approximation
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- On sample average approximation for two-stage stochastic programs without relatively complete recourse
- Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm
- Robust resource allocations in temporal networks
- Asset allocation using reliability method
- Regularized decomposition of large scale block-structured robust optimization problems
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities
- An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets
- Cascading: An adjusted exchange method for robust conic programming
- Probabilistic guarantees in robust optimization
- Selected topics in robust convex optimization
- Derivative-free robust optimization for circuit design
- Strong formulations of robust mixed 0-1 programming
- A note on distributionally robust optimization under moment uncertainty
- A robust robust optimization result
- A utility theory based interactive approach to robustness in linear optimization
- Thresholded covering algorithms for robust and max-min optimization
- Robust nonlinear optimization with conic representable uncertainty set
- On the influence of robustness measures on shape optimization with stochastic uncertainties
- Optimality and duality for robust multiobjective optimization problems
- Robust optimization with applications to game theory
- Mixed complementarity problems for robust optimization equilibrium in bimatrix game.
- A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay
- Convexity and convex approximations of discrete-time stochastic control problems with constraints
- Modelling some robust design problems via conic optimization
- On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs
- Robust quadratic programming with mixed-integer uncertainty
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Tractable approximation to robust nonlinear production frontier problem
- Arc routing under uncertainty: introduction and literature review
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
- Ambiguous chance constrained problems and robust optimization
- Robust multiobjective optimization with application to Internet routing
- Guaranteed model-based fault detection in cyber-physical systems: a model invalidation approach
- Stochastic model predictive control with joint chance constraints
- Applying convexificators in robust multiobjective optimization
- Robust optimization with simulated annealing
- Risk-Averse Stochastic Programming vs. Adaptive Robust Optimization: A Virtual Power Plant Application
- Approximate convex hull based scenario truncation for chance constrained trajectory optimization
- Adjustable robust counterpart of conic quadratic problems
- Robust \(\epsilon\)-support vector regression
- A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Multi-resource allocation in stochastic project scheduling
- Distributionally robust optimization. A review on theory and applications
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Linear controller design for chance constrained systems
- Biobjective robust simulation-based optimization for unconstrained problems
- Robust and reliable portfolio optimization formulation of a chance constrained problem
- Robust linear MIMO in the downlink: A worst-case optimization with ellipsoidal uncertainty regions
- Relaxed robust second-order-cone programming
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- A brief overview of interdiction and robust optimization
- Robust convex optimization: a new perspective that unifies and extends
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
- Robust optimization approximation for ambiguous P-model and its application
This page was built for publication: Tractable approximations to robust conic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492681)
