Optimization Online


Primal-dual methods for solving infinite-dimensional games

Pavel Dvurechensky (pavel.dvurechensky***at***gmail.com)
Yurii Nesterov (Yurii.Nesterov***at***uclouvain.be)
Vladimir Spokoiny (spokoiny***at***wias-berlin.de)

Abstract: In this paper we show that the infinite-dimensional differential games with simple objective functional can be solved in a finite-dimensional dual form in the space of dual multipliers for the constraints related to the end points of the trajectories. The primal solutions can be easily reconstructed by the appropriate dual subgradient schemes. The suggested schemes are justified by the worst-case complexity analysis.

Keywords: Convex optimization, primal-dual methods, differential games, complexity estimates

Category 1: Convex and Nonsmooth Optimization

Category 2: Infinite Dimensional Optimization (Semi-infinite Programming )


Download: [PDF]

Entry Submitted: 09/18/2013
Entry Accepted: 09/18/2013
Entry Last Modified: 11/28/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society