Work

Dynamic Dualization in a General Setting

Year: 2017

Type: article

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.

Source: Journal of the Operations Research Society of Japan

DOI: 10.15807/jorsj.60.44

Author: Hidefumi Kawasaki

Institution: Kyushu University

Language: English

Topic: Optimization and Variational Analysis

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Japan Society for the Promotion of Science

Award: Formulation of discrete nonlinear programming