Abstract
The utility of Dune-ACFem is demonstrated to work well for solving a non-smooth
minimization problem over bounded variation functions by implementing a primal-dual algo-rithm. The implementation is based on the simplification provided by Dune-ACFem. Moreover, the convergence of the discrete minimizer to the continuous one is shown theoretically.
minimization problem over bounded variation functions by implementing a primal-dual algo-rithm. The implementation is based on the simplification provided by Dune-ACFem. Moreover, the convergence of the discrete minimizer to the continuous one is shown theoretically.
| Original language | English |
|---|---|
| Journal | Archive of Numerical Software |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 3 Apr 2017 |
| Externally published | Yes |