Sparsifying dimensionality reduction of PDE solution data with Bregman learning
linearized Bregman iterationsmachine learningnonlinear dimensionality reductionorthogonalizationpartial differential equationsparsity
Multidimensional problems (41A63) Numerical approximation of high-dimensional functions; sparse grids (65D40) Numerical solution of discretized equations for initial value and initial-boundary value problems involving PDEs (65M22) Learning and adaptive systems in artificial intelligence (68T05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
- A comprehensive deep learning-based approach to reduced order modeling of nonlinear time-dependent parametrized PDEs
- A graph convolutional autoencoder approach to model order reduction for parametrized PDEs
- An adaptive inverse scale space method for compressed sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Analysis of a complex of statistical variables into principal components.
- Breaking the Kolmogorov Barrier with Nonlinear Model Reduction
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Choose your path wisely: gradient descent in a Bregman distance framework
- Data-driven discovery of coordinates and governing equations
- Downdating the Singular Value Decomposition
- Dynamic mode decomposition of numerical and experimental data
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Galerkin v. least-squares Petrov-Galerkin projection in nonlinear model reduction
- Higher-order TV methods -- enhancement via Bregman iteration
- scientific article; zbMATH DE number 3176450 (Why is no real title available?)
- Iterative total variation schemes for nonlinear inverse problems
- Linear dimensionality reduction: survey, insights, and generalizations
- Linearized Bregman iterations for compressed sensing
- Mesh-informed neural networks for operator learning in finite element spaces
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders
- Modern regularization methods for inverse problems
- On dynamic mode decomposition: theory and applications
- Primal and dual Bregman methods with application to optical nanoscopy
- Reduced basis methods for partial differential equations. An introduction
This page was built for publication: Sparsifying dimensionality reduction of PDE solution data with Bregman learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924996)
