Cascading: An adjusted exchange method for robust conic programming
type: Item
instance of: scholarly article
title: Cascading: An adjusted exchange method for robust conic programming
zbMATH Open document ID: 1152.90630
author: Ralf Werner
published in: CEJOR. Central European Journal of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5320581
zbMATH Keywords: robust programming
zbMATH Keywords: conic programming
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: exchange method
describes a project that uses: PENNON
MaRDI profile type: Publication
full work available at URL: s10100-007-0047-6
OpenAlex ID: W2005344960
cites work: An interior semi-infinite programming method
cites work: Robust convex optimization
cites work: Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
cites work: Robust optimization-methodology and applications
cites work: Tractable approximations to robust conic optimization problems
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: Cutting plane algorithms for robust conic convex optimization problems
cites work: PENNON: A code for convex nonlinear and semidefinite programming
cites work: Q5566063
cites work: Q3840143
cites work: Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
cites work: Q4235027
cites work: Q3840144
DOI: 10.1007/S10100-007-0047-6
Recommended article: Stable Lagrange dualities for robust conical programming
Recommended article: Adjustable robust counterpart of conic quadratic problems
Recommended article: Convex Maximization via Adjustable Robust Optimization
Recommended article: Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
Recommended article: Robust convex quadratically constrained programs
Recommended article: Tractable approximations to robust conic optimization problems
Recommended article: Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
Recommended article: Q5498974
Recommended article: Relaxed robust second-order-cone programming
Recommended article: Robust convex optimization: a new perspective that unifies and extends
description: scientific article; zbMATH DE number 5320581