Skip to main navigation Skip to search Skip to main content

A policy iteration algorithm for fixed point problems with nonexpansive operators

  • INRIA Institut National de Recherche en Informatique et en Automatique

Research output: Contribution to journalArticlepeer-review

Abstract

The aim of this paper is to solve the fixed point problems: ν = O ν, with O ν(x) = def max (L ν (x), B ν (x)), χ ∈ ε where ε is a finite set, L is contractive and B is a nonexpansive operator and ν = O ν, with O ν(x) = def max (supw ∈ W Lw ν(x), supz ∈ Z Bz ν(x)), χ ∈ ε, (2) where W and Z are general control sets, the operators L w are contractive and operators B z are nonexpansive. For these two problems, we give conditions which imply existence and uniqueness of a solution and provide a policy iteration algorithm which converges to the solution. The proofs are slightly different for the two problems since the set of controls is finite for (1) while it is not necessary the case for problem (2). Equation (2) typically arises in numerical analysis of quasi variational inequalities and variational inequalities associated to impulse or singular stochastic control.

Original languageEnglish
Pages (from-to)239-259
Number of pages21
JournalMathematical Methods of Operations Research
Volume65
Issue number2
DOIs
Publication statusPublished - 1 Apr 2007

Keywords

  • Fixed point problems
  • Howard algorithm
  • Impulse control
  • Nonexpansive operators
  • Optimal control of Markov Chains
  • Policy iteration
  • Quasi-variational inequalities

Fingerprint

Dive into the research topics of 'A policy iteration algorithm for fixed point problems with nonexpansive operators'. Together they form a unique fingerprint.

Cite this