Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: On perturbed steepest descent methods with inexact line search for bilevel convex optimization
Author: Neto, ESH
De Pierro, AR
Abstract: We use a general framework for solving convex constrained optimization problems introduced in an earlier work to obtain algorithms for problems with a constraint set defined as the set of minimizers of a given function. Also, the algorithms allow the objective function to be decomposed as a sum of other convex functions that can be treated separately. We prove that the general algorithm converges to the optimum of the objective function over the set of minima of a convex Lipschitz-differentiable function chosen previously. When using orthogonal projections onto the convex constraints, we retrieve a Cimmino-like algorithm that converges to the optimum over the set of weighted least squares solutions. Furthermore, we show an important application of our approach to compressed sensing and inverse problems.
Subject: convex optimization
Country: Inglaterra
Editor: Taylor & Francis Ltd
Citation: Optimization. Taylor & Francis Ltd, v. 60, n. 41890, n. 991, n. 1008, 2011.
Rights: fechado
Identifier DOI: 10.1080/02331934.2010.536231
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000299695600004.pdf348.98 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.