An exact formula for radius of robust feasibility of uncertain linear programs
type: Item
instance of: scholarly article
title: An exact formula for radius of robust feasibility of uncertain linear programs
zbMATH Open document ID: 1373.49035
author: Thai Doan Chuong
author: V. Jeyakumar
published in: Journal of Optimization Theory and Applications
publication date: 2017-09-01T00:00:00Z
Mathematics Subject Classification ID: 49N05
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6768802
zbMATH Keywords: uncertain linear program
zbMATH Keywords: robust linear optimization
zbMATH Keywords: spectrahedron
zbMATH Keywords: robust solution
zbMATH Keywords: linear matrix inequality
MaRDI profile type: MaRDI publication profile
full work available at URL: s10957-017-1067-6
OpenAlex ID: W2580320326
cites work: A Robust Optimization Approach to Inventory Theory
cites work: Robust portfolios: contributions from operations research and finance
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Q3182207
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Duality in robust optimization: Primal worst equals dual best
cites work: Mean-Squared Error Estimation for Linear Systems with Block Circulant Uncertainty
cites work: Deriving robust counterparts of nonlinear uncertain inequalities
cites work: Theory and Applications of Robust Optimization
cites work: Constructing Uncertainty Sets for Robust Linear Optimization
cites work: Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
cites work: Characterizing robust set containments and solutions of uncertain linear programs without qualifications
cites work: Robust SOS-convex polynomial optimization problems: exact SDP relaxations
cites work: Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
cites work: Robust solutions to multi-objective linear programs with uncertain data
cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
cites work: Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
cites work: Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
cites work: Stability and Well-Posedness in Linear Semi-Infinite Programming
cites work: Nonsmooth analysis
cites work: Q4357206
cites work: Robust global error bounds for uncertain linear inequality systems with applications
cites work: Chapter 6: Semidefinite Representability
cites work: Some geometric results in semidefinite programming
cites work: What is \dots a spectrahedron?
DOI: 10.1007/S10957-017-1067-6
description: scientific article; zbMATH DE number 6768802