Dynamic dualization in a general setting

研究成果: ジャーナルへの寄稿記事

抄録

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.

元の言語英語
ページ(範囲)44-49
ページ数6
ジャーナルJournal of the Operations Research Society of Japan
60
発行部数2
DOI
出版物ステータス出版済み - 4 1 2017

Fingerprint

Objective function
Dual problem
Convolution
Duality
Optimization problem

All Science Journal Classification (ASJC) codes

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

これを引用

Dynamic dualization in a general setting. / Kawasaki, Hidefumi.

:: Journal of the Operations Research Society of Japan, 巻 60, 番号 2, 01.04.2017, p. 44-49.

研究成果: ジャーナルへの寄稿記事

@article{591d035b7eea4f959b0e315610990461,
title = "Dynamic dualization in a general setting",
abstract = "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.",
author = "Hidefumi Kawasaki",
year = "2017",
month = "4",
day = "1",
doi = "10.15807/jorsj.60.44",
language = "English",
volume = "60",
pages = "44--49",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "2",

}

TY - JOUR

T1 - Dynamic dualization in a general setting

AU - Kawasaki, Hidefumi

PY - 2017/4/1

Y1 - 2017/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85018440158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018440158&partnerID=8YFLogxK

U2 - 10.15807/jorsj.60.44

DO - 10.15807/jorsj.60.44

M3 - Article

AN - SCOPUS:85018440158

VL - 60

SP - 44

EP - 49

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 2

ER -