Efficient iterative solution of finite element discretized nonsmooth minimization problems

DOI10.1016/j.camwa.2020.04.026zbMath1447.65127OpenAlexW3030035413MaRDI QIDQ2194780

Marijo Milicevic, Sören Bartels

Publication date: 7 September 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2020.04.026

zbMATH Keywords

convergencefinite elementsconvex minimizationalternating direction method of multipliersvariable step sizes

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (2)

Approximation Schemes for Materials with Discontinuities ⋮ Adaptive regularization, discretization, and linearization for nonsmooth problems based on primal-dual gap estimators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fast alternating linearization methods for minimizing the sum of two convex functions
• On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A variable-penalty alternating directions method for convex optimization
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Self-adaptive operator splitting methods for monotone variational inequalities
• Introductory lectures on convex optimization. A basic course.
• An algorithm for total variation minimization and applications
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A first-order primal-dual algorithm for convex problems with applications to imaging
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Multiplier and gradient methods
• A sequential updating scheme of the Lagrange multiplier for separable convex programming
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• The Split Bregman Method for L1-Regularized Problems
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• Fast Alternating Direction Optimization Methods
• Discrete Total Variation Flows without Regularization
• Sur la régularité de la solution d'inéquations elliptiques
• Introduction

This page was built for publication: Efficient iterative solution of finite element discretized nonsmooth minimization problems