Efficient iterative solution of finite element discretized nonsmooth minimization problems
From MaRDI portal
Publication:2194780
alternating direction method of multipliersconvergenceconvex minimizationfinite elementsvariable step sizes
Numerical methods based on nonlinear programming (49M37) Numerical optimization and variational techniques (65K10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Convex programming (90C25)
Recommendations
- ADMM and Non-convex Variational Problems
- Finite element discretization and iterative solution of total variation regularized minimization problems and application to the simulation of rate-independent damage evolutions
- Total variation minimization with finite elements: convergence and iterative solution
- Iterative finite element solution of a constrained total variation regularized model problem
- Truncated nonsmooth Newton multigrid methods for convex minimization problems
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- A variable-penalty alternating directions method for convex optimization
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An algorithm for total variation minimization and applications
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Discrete total variation flows without regularization
- Fast alternating direction optimization methods
- Fast alternating linearization methods for minimizing the sum of two convex functions
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3919744 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- Nonlinear total variation based noise removal algorithms
- Numerical methods for nonlinear partial differential equations
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Self-adaptive operator splitting methods for monotone variational inequalities
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Sur la régularité de la solution d'inéquations elliptiques
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The Split Bregman Method for L1-Regularized Problems
Cited in
(6)- Efficient optimization-based quadrature for variational discretization of nonlocal problems
- Approximation schemes for materials with discontinuities
- Adaptive regularization, discretization, and linearization for nonsmooth problems based on primal-dual gap estimators
- Shape optimization in \(W^{1,\infty}\) with geometric constraints: a study in distributed-memory systems
- Convergence of a steepest descent algorithm in shape optimisation using \(W^{1\infty}\) functions
- PDE-constrained shape optimization with first-order and Newton-type methods in the W 1,∞ topology
This page was built for publication: Efficient iterative solution of finite element discretized nonsmooth minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194780)
