Home >

news Help

Publication Information


Title
Japanese: 
English:Hierarchical Convex Optimization with Primal-Dual Splitting 
Author
Japanese: 小野 峻佑, 山田 功.  
English: Shunsuke Ono, Isao Yamada.  
Language English 
Journal/Book name
Japanese: 
English:IEEE Transactions on Signal Processing 
Volume, Number, Page vol. 63    no. 2    pp. 373-388
Published date Jan. 15, 2015 
Publisher
Japanese: 
English: 
Conference name
Japanese: 
English: 
Conference site
Japanese: 
English: 
DOI https://doi.org/10.1109/TSP.2014.2373318
Abstract This paper addresses the selection of a desirable solution among all the solutions of a convex optimization problem (referred to as the first-stage problem) mainly for inverse problems in signal processing. This is realized in the framework of hierarchical convex optimization, i.e., minimizing another convex function over the solution set of the first-stage problem. Hierarchical convex optimization is an ideal strategy when the first-stage problem has infinitely many solutions because of the non-strict convexity of its objective function, which could arise in various scenarios, e.g., convex feasibility problems. To this end, first, the fixed point set characterization behind a primal-dual splitting type method is incorporated into the framework of hierarchical convex optimization, which enables the framework to cover a broad class of first-stage problem formulations. Then, a pair of efficient algorithmic solutions to the hierarchical convex optimization problem, as certain realizations of the hybrid steepest descent method, are provided with guaranteed convergence. We also present a specialized form of the proposed framework to focus on a typical scenario of inverse problems, and show its application to signal interpolation.

©2007 Tokyo Institute of Technology All rights reserved.