Convergence of a greedy algorithm for high-dimensional convex nonlinear problems

@inproceedings{Cancs2010ConvergenceOA,
  title={Convergence of a greedy algorithm for high-dimensional convex nonlinear problems},
  author={Eric Canc{\`e}s and Virginie Ehrlacher and Tony Leli{\`e}vre},
  year={2010}
}
In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of the energy is Lipschitz on bounded sets. The main interest of this method is that it can be used for high-dimensional nonlinear convex problems. We illustrate this method on a prototypical example for uncertainty propagation on the obstacle problem. 

Figures from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 57 CITATIONS

Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Adaptive Near-Optimal Rank Tensor Approximation for High-Dimensional Operator Equations

VIEW 1 EXCERPT
CITES BACKGROUND

On Minimal Subspaces in Tensor Representations

VIEW 1 EXCERPT

Proper generalised decompositions : theory and applications

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2011
2020

CITATION STATISTICS

  • 6 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES