On the convergence of alternating minimization methods in variational PGD
From MaRDI portal
Publication:1687320
DOI10.1007/s10589-017-9920-yzbMath1383.49037OpenAlexW2733222160MaRDI QIDQ1687320
Publication date: 22 December 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9920-y
Optimality conditions for problems involving partial differential equations (49K20) Numerical optimization and variational techniques (65K10) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items
A stabilized mixed formulation using the proper generalized decomposition for fluid problems, Global convergence of rank-one PGD approximations by alternate minimization
Cites Work
- Unnamed Item
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- A proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approach
- A priori model reduction through proper generalized decomposition for solving time-dependent partial differential equations
- Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
- POD a-posteriori error estimates for linear-quadratic optimal control problems
- A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids
- On the Dirac-Frenkel variational principle on tensor Banach spaces
- Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators
- The proper generalized decomposition for advanced numerical simulations. A primer
- Rank-One Approximation to High Order Tensors
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Tensor Spaces and Numerical Tensor Calculus
- Greedy algorithms for high-dimensional non-symmetric linear problems
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem