Nonconcave robust optimization with discrete strategies under Knightian uncertainty

Ariel Neufeld*, Mario Šikić

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We study robust stochastic optimization problems in the quasi-sure setting in discrete-time. The strategies in the multi-period-case are restricted to those taking values in a discrete set. The optimization problems under consideration are not concave. We provide conditions under which a maximizer exists. The class of problems covered by our robust optimization problem includes optimal stopping and semi-static trading under Knightian uncertainty.

Original languageEnglish
Pages (from-to)229-253
Number of pages25
JournalMathematical Methods of Operations Research
Volume90
Issue number2
DOIs
Publication statusPublished - Oct 1 2019
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

ASJC Scopus Subject Areas

  • Software
  • General Mathematics
  • Management Science and Operations Research

Keywords

  • Knightian uncertainty
  • Nonconcave robust optimization
  • Robust utility maximization

Fingerprint

Dive into the research topics of 'Nonconcave robust optimization with discrete strategies under Knightian uncertainty'. Together they form a unique fingerprint.

Cite this