-subgradient algorithms for bilevel convex optimization

DOI10.1088/1361-6420/AA6136zbMATH Open1377.90065arXiv1703.02648OpenAlexW2588501147MaRDI QIDQ5268487FDOQ5268487

Authors: Elias Salomão Helou, Lucas E. A. Simões 

Publication date: 20 June 2017

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: This paper introduces and studies the convergence properties of a new class of explicit $epsilon$-subgradient methods for the task of minimizing a convex function over the set of minimizers of another convex minimization problem. The general algorithm specializes to some important cases, such as first-order methods applied to a varying objective function, which have computationally cheap iterations. We present numerical experimentation regarding certain applications where the theoretical framework encompasses efficient algorithmic techniques, enabling the use of the resulting methods to solve very large practical problems arising in tomographic image reconstruction.

Full work available at URL: https://arxiv.org/abs/1703.02648

Recommendations

• Incremental subgradients for constrained convex optimization: A unified framework and new methods
• scientific article; zbMATH DE number 5176444
• A first order method for solving convex bilevel optimization problems
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization
• Scaling techniques for \(\epsilon\)-subgradient methods

zbMATH Keywords

bilevel optimizationtomographic image reconstructionepsilo-subgradient methods

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Cited In (14)

• Title not available (Why is that?)
• Optimal subgradient methods: computational properties for large-scale linear inverse problems
• A first-order method for solving bilevel convex optimization problems in Banach space
• Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization
• Algorithms for simple bilevel programming
• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
• Title not available (Why is that?)
• Incremental subgradients for constrained convex optimization: A unified framework and new methods
• Scaling techniques for \(\epsilon\)-subgradient methods
• A primal nonsmooth reformulation for bilevel optimization problems
• An online convex optimization-based framework for convex bilevel optimization
• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
• Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function

Uses Software

• NFFT3

This page was built for publication: \(\epsilon\)-subgradient algorithms for bilevel convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268487)