.png){kind=icon}
.png){kind=icon}
Return
CONVERGENCE OF A GREEDY ALGORITHM FOR HIGH-DIMENSIONAL CONVEX NONLINEAR PROBLEMS
.png){kind=icon}
OA
AI
DOI：10.1142/S0218202511005799.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, 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.
Keywords:
Greedy algorithm
high dimension
obstacle problem
uncertainty quantification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.2K
Citations:
4.6K