Dynamic dualization in a general setting

Hidefumi Kawasaki

    Research output: Contribution to journalArticlepeer-review


    Recently, Iwamoto, Kimura, and Ueno proposed dynamic dualization to present dual problems for unconstrained optimization problems whose objective function is a sum of squares. The aim of this paper is to show that dynamic dualization works well for unconstrained problems whose objective function is a sum of convex functions. Further we give another way to get dual problems, which is based on the infimal convolution. In both approaches we make clear the assumption for duality to hold.

    Original languageEnglish
    Pages (from-to)44-49
    Number of pages6
    JournalJournal of the Operations Research Society of Japan
    Issue number2
    Publication statusPublished - Apr 2017

    All Science Journal Classification (ASJC) codes

    • Decision Sciences(all)
    • Management Science and Operations Research


    Dive into the research topics of 'Dynamic dualization in a general setting'. Together they form a unique fingerprint.

    Cite this