Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
From MaRDI portal
Publication:2514448
DOI10.1007/s00791-011-0163-7zbMath1308.65015OpenAlexW1976121046MaRDI QIDQ2514448
Killian Miller, Geoffrey Sanders, Hans De Sterck
Publication date: 3 February 2015
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00791-011-0163-7
Computational methods in Markov chains (60J22) Convex programming (90C25) Numerical analysis or methods applied to Markov chains (65C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains
- Acceleration by aggregation of successive approximation methods
- A local convergence proof for the iterative aggregation method
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- Krylov subspace acceleration for nonlinear multigrid schemes
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
- On a two-level multigrid solution method for finite Markov chains
- Multilevel Solutions for Structured Markov Chains
- An ellipsoid algorithm for nonlinear programming
- Smoothed Aggregation Multigrid for Markov Chains
- Algebraic Multigrid for Markov Chains
- Square and stretch multigrid for stochastic matrix eigenproblems
- On-the-Fly Adaptive Smoothed Aggregation Multigrid for Markov Chains
- Recursively Accelerated Multilevel Aggregation for Markov Chains
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Matrix Analysis
- Using deep cuts in an ellipsoid algorithm for nonlinear programming
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- Feature Article—The Ellipsoid Method: A Survey
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Numerical Methods in Markov Chain Modeling
- On Recombining Iterants in Multigrid Algorithms and Problems with Small Islands
- A Multigrid Tutorial, Second Edition
- Nonlinear Programming
- Convex Analysis
- Aggregation of Variables in Dynamic Systems
