Robust portfolio selection problems
Mathematics of Operations Research
Polynomial solution to stabilization problem for multivariable sampled-data systems with time delay
Automation and Remote Control
Geometric programming for communication systems
Communications and Information Theory
Robust One-Period Option Hedging
Operations Research
Robust multiclass kernel-based classifiers
Computational Optimization and Applications
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
Automatica (Journal of IFAC)
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Reliable water supply system design under uncertainty
Environmental Modelling & Software
Journal of Computational and Applied Mathematics
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Robust Unsupervised and Semi-supervised Bounded ν - Support Vector Machines
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Logic synthesis for reducing leakage power consumption under workload uncertainty
ICC'08 Proceedings of the 12th WSEAS international conference on Circuits
Constructing Risk Measures from Uncertainty Sets
Operations Research
IEEE Transactions on Signal Processing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
Operations Research
Constructing Uncertainty Sets for Robust Linear Optimization
Operations Research
Robust and chance-constrained optimization under polynomial uncertainty
ACC'09 Proceedings of the 2009 conference on American Control Conference
Exploiting sparsity in the sum-of-squares approximations to robust semidefinite programs
ACC'09 Proceedings of the 2009 conference on American Control Conference
Wardrop Equilibria with Risk-Averse Users
Transportation Science
Unsupervised and semi-supervised Lagrangian support vector machines with polyhedral perturbations
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
Transportation Science
Robust Approximation to Multiperiod Inventory Management
Operations Research
Optimality of Affine Policies in Multistage Robust Optimization
Mathematics of Operations Research
A robust optimization approach for imprecise data envelopment analysis
Computers and Industrial Engineering
Robust power allocation algorithms for wireless relay networks
IEEE Transactions on Communications
A Soft Robust Model for Optimization Under Ambiguity
Operations Research
Distributionally Robust Optimization and Its Tractable Approximations
Operations Research
Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
Computers and Operations Research
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Survey paper: Research on probabilistic methods for control system design
Automatica (Journal of IFAC)
Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities
Journal of Computational and Applied Mathematics
Robust portfolio selection problem for an insurer with exponential utility preference
WSEAS Transactions on Mathematics
Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm
Computers and Industrial Engineering
SIAM Journal on Optimization
Theory and Applications of Robust Optimization
SIAM Review
Brief Robust maximum likelihood estimation in the linear model
Automatica (Journal of IFAC)
A probabilistic framework for problems with real structured uncertainty in systems and control
Automatica (Journal of IFAC)
Ellipsoidal bounds for uncertain linear equations and dynamical systems
Automatica (Journal of IFAC)
Asset allocation using reliability method
Mathematical and Computer Modelling: An International Journal
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Discrete Optimization
Robust linear optimization under general norms
Operations Research Letters
Optimization Under Probabilistic Envelope Constraints
Operations Research
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
Robust Storage Assignment in Unit-Load Warehouses
Management Science
Robust optimization model for a class of uncertain linear programs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Robust attitude control design for spacecraft under assigned velocity and control constraints
ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part I
SDP reformulation for robust optimization problems based on nonconvex QP duality
Computational Optimization and Applications
Journal of the ACM (JACM)
Regularized robust optimization: the optimal portfolio execution case
Computational Optimization and Applications
Causal state-feedback parameterizations in robust model predictive control
Automatica (Journal of IFAC)
Common weights data envelopment analysis with uncertain data: A robust optimization approach
Computers and Industrial Engineering
RMARS: Robustification of multivariate adaptive regression spline under polyhedral uncertainty
Journal of Computational and Applied Mathematics
| Hi-index | 0.03 |
In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize the (worst-case) objective while satisfying the constraints for every possible value of parameters within the given bounds. Assuming the data matrices are rational functions of the perturbation parameters, we show how to formulate sufficient conditions for a robust solution to exist as SDPs. When the perturbation is "full," our conditions are necessary and sufficient. In this case, we provide sufficient conditions which guarantee that the robust solution is unique and continuous (Hölder-stable) with respect to the unperturbed problem's data. The approach can thus be used to regularize ill-conditioned SDPs. We illustrate our results with examples taken from linear programming, maximum norm minimization, polynomial interpolation, and integer programming.