Techniques for gradient-based bilevel optimization with non-smooth lower level problems
From MaRDI portal
Publication:334266
DOI10.1007/s10851-016-0663-7zbMath1352.65155arXiv1602.07080OpenAlexW2278603371MaRDI QIDQ334266
René Ranftl, Peter Ochs, Thomas Brox, Thomas Pock
Publication date: 1 November 2016
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07080
iterative algorithmnumerical examplebilevel optimizationBregman proximity functionnon-smooth lower level problem
Related Items
A non-convex non-smooth bi-level parameter learning for impulse and Gaussian noise mixture removing, Optimality Conditions for Bilevel Imaging Learning Problems with Total Variation Regularization, Techniques for gradient-based bilevel optimization with non-smooth lower level problems, A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification, Uncertainty-safe large scale support vector machines, Convergence of a Piggyback-Style Method for the Differentiation of Solutions of Standard Saddle-Point Problems, Linearly convergent bilevel optimization with single-step inner methods, Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization, Unnamed Item, Modern regularization methods for inverse problems, A note on a bilevel problem for parameter learning for inverse problems with the wave equation, A regularized convolutional neural network for semantic image segmentation, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Deep convolutional neural networks with spatial regularization, volume and star-shape priors for image segmentation, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method, Bilevel Methods for Image Reconstruction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The structure of optimal parameters for image restoration problems
- On the limited memory BFGS method for large scale optimization
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Image denoising: learning the noise model via nonsmooth PDE-constrained optimization
- A Bilevel Optimization Approach for Parameter Learning in Variational Models
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Dynamic Sampling Schemes for Optimal Noise Learning Under Multiple Nonsmooth Constraints
- Evaluating Derivatives
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection
- Bilevel Programming Problems
- Function minimization by conjugate gradients
- Convex Analysis
- Heavy-ball method in nonconvex optimization problems
