TY - JOUR
T1 - Dynamic dualization in a general setting
AU - Kawasaki, Hidefumi
N1 - Funding Information:
The author would like to thank anonymous referees for careful reading and useful comments, which improved our paper. This research was supported by JSPS KAKENHI Grant Number 16K05278.
Publisher Copyright:
© The Operations Research Society of Japan.
PY - 2017/4
Y1 - 2017/4
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
SN - 0453-4514
VL - 60
SP - 44
EP - 49
JO - Journal of the Operations Research Society of Japan
JF - Journal of the Operations Research Society of Japan
IS - 2
ER -