Pages that link to "Item:Q306368"
From MaRDI portal
The following pages link to Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368):
Displaying 22 items.
- Damped Anderson Acceleration With Restarts and Monotonicity Control for Accelerating EM and EM-like Algorithms (Q112514) (← links)
- Fractional-step \(\theta\)-method for solving singularly perturbed problem in ecology (Q723727) (← links)
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies (Q827072) (← links)
- An algorithm for best rational approximation based on barycentric rational interpolation (Q2048834) (← links)
- Geometric adaptive Monte Carlo in random environment (Q2072631) (← links)
- Improved convergence of the Arrow-Hurwicz iteration for the Navier-Stokes equation via grad-div stabilization and Anderson acceleration (Q2104095) (← links)
- Efficient algorithms for solving condition number-constrained matrix minimization problems (Q2226404) (← links)
- Enabling convergence of the iterated penalty Picard iteration with \(O ( 1 )\) penalty parameter for incompressible Navier-Stokes via Anderson acceleration (Q2246415) (← links)
- Anymatrix: an extensible MATLAB matrix collection (Q2672725) (← links)
- Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones (Q2674582) (← links)
- Nonlinear acceleration of momentum and primal-dual algorithms (Q2687048) (← links)
- Bounds for the Distance to the Nearest Correlation Matrix (Q2818268) (← links)
- Shanks Sequence Transformations and Anderson Acceleration (Q4580296) (← links)
- Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations (Q5034831) (← links)
- Anderson Acceleration for Nonsmooth Fixed Point Problems (Q5043623) (← links)
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations (Q5139834) (← links)
- Anderson Acceleration of Nonlinear Solvers for the Stationary Gross-Pitaevskii Equation (Q5157079) (← links)
- A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically) (Q5217606) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- The effect of Anderson acceleration on superlinear and sublinear convergence (Q6111360) (← links)
- Efficient and effective algebraic splitting‐based solvers for nonlinear saddle point problems (Q6118915) (← links)
- Polynomial whitening for high-dimensional data (Q6178887) (← links)