Compressed modes for variational problems in mathematics and physics
From MaRDI portal
Publication:5170978
DOI10.1073/pnas.1318679110zbMath1292.81024arXiv1308.1758OpenAlexW1972649461WikidataQ37319557 ScholiaQ37319557MaRDI QIDQ5170978
Rongjie Lai, Vidvuds Ozoliņš, Stanley J. Osher, Russel E. Caflisch
Publication date: 25 July 2014
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.1758
Related Items
Compressed vibration modes of elastic bodies ⋮ Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization ⋮ On the Support of Compressed Modes ⋮ A variational framework for computing Wannier functions using dictionary learning ⋮ Localized density matrix minimization and linear-scaling algorithms ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Sparsity enabled cluster reduced-order models for control ⋮ SCDM-k: localized orbitals for solids via selected columns of the density matrix ⋮ Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra ⋮ Orbital minimization method with \(\ell^{1}\) regularization ⋮ Compact representation of one-particle wavefunctions and scalar fields obtained from electronic-structure calculations ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ TTDFT: a GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ Proximal gradient algorithm with trust region scheme on Riemannian manifold ⋮ Computing Localized Representations of the Kohn--Sham Subspace Via Randomization and Refinement ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ Compressed plane waves yield a compactly supported multiresolution basis for the Laplace operator ⋮ Hidden physics models: machine learning of nonlinear partial differential equations ⋮ A Riemannian Proximal Newton Method ⋮ Online Interpolation Point Refinement for Reduced-Order Models using a Genetic Algorithm ⋮ An inexact Riemannian proximal gradient method ⋮ Variational Formulation for Wannier Functions with Entangled Band Structure ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ Mathematical methods in quantum chemistry. Abstracts from the workshop held March 18--24, 2018 ⋮ Learning partial differential equations via data discovery and sparse optimization ⋮ Computing Eigenvalues and Eigenfunctions of Schrödinger Equations Using a Model Reduction Approach ⋮ Deep Hidden Physics Models: Deep Learning of Nonlinear Partial Differential Equations ⋮ Flat solutions of some non-Lipschitz autonomous semilinear equations may be stable for \(N \geq 3\) ⋮ A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices ⋮ Exploring the Locally Low Dimensional Structure in Solving Random Elliptic PDEs ⋮ Sparse operator compression of higher-order elliptic operators with rough coefficients ⋮ Sparse Principal Component Analysis via Variable Projection ⋮ Disentanglement via Entanglement: A Unified Method for Wannier Localization ⋮ Sparse + low-energy decomposition for viscous conservation laws ⋮ Discovering governing equations from data by sparse identification of nonlinear dynamical systems ⋮ Shape partitioning via \({L}_{p}\) compressed modes ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Global optimization with orthogonality constraints via stochastic diffusion on manifold ⋮ On the Compressive Spectral Method ⋮ An $L^1$ Penalty Method for General Obstacle Problems ⋮ Compactly supported Wannier functions and strictly local projectors
Cites Work
- Sparse principal component analysis by choice of norm
- Localized bases of eigensubspaces and operator compression
- The Split Bregman Method for L1-Regularized Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Quantum mechanics of electrons in crystal lattices
- Sparse dynamics for partial differential equations
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- The Structure of Electronic Excitation Levels in Insulating Crystals
- Phase Retrieval via Matrix Completion
- Compressed sensing
