Techniques for gradient-based bilevel optimization with non-smooth lower level problems
type: Item
instance of: scholarly article
title: Techniques for gradient-based bilevel optimization with non-smooth lower level problems
zbMATH Open document ID: 1352.65155
author: Peter Ochs
author: René Ranftl
author: Thomas Brox
author: Thomas Pock
published in: Journal of Mathematical Imaging and Vision
publication date: 2016-11-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/1602.07080
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6646049
zbMATH Keywords: bilevel optimization
zbMATH Keywords: non-smooth lower level problem
zbMATH Keywords: Bregman proximity function
zbMATH Keywords: numerical example
zbMATH Keywords: iterative algorithm
describes a project that uses: L-BFGS
describes a project that uses: iPiano
describes a project that uses: MatConvNet
describes a project that uses: Adam
MaRDI profile type: Publication
OpenAlex ID: W2278603371
arXiv ID: 1602.07080
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: Q5580053
cites work: Dynamic Sampling Schemes for Optimal Noise Learning Under Multiple Nonsmooth Constraints
cites work: Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: On the ergodic convergence rates of a first-order primal-dual algorithm
cites work: Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection
cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
cites work: Bilevel Programming Problems
cites work: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
cites work: Q3134551
cites work: Function minimization by conjugate gradients
cites work: Evaluating Derivatives
cites work: A bilevel optimization approach for parameter learning in variational models
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: On the limited memory BFGS method for large scale optimization
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: The structure of optimal parameters for image restoration problems
cites work: Image denoising: learning the noise model via nonsmooth PDE-constrained optimization
cites work: Convex Analysis
cites work: Q3093306
cites work: Heavy-ball method in nonconvex optimization problems
DOI: 10.1007/S10851-016-0663-7
description: scientific article