DOI10.1137/070689413zbMath1189.05072arXiv0709.0955OpenAlexW3105329945WikidataQ102127988 ScholiaQ102127988MaRDI QIDQ3563906
Persi Diaconis, Pablo A. Parrilo, Lin Xiao, Stephen P. Boyd
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.0955
The generalized distance spectrum of a graph and applications,
Eigen-stratified models,
Augmented Lagrangian methods for convex matrix optimization problems,
Comparison inequalities and fastest-mixing Markov chains,
Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions,
On random walks and switched random walks on homogeneous spaces,
Analysis of a non-reversible Markov chain speedup by a single edge,
Dimension reduction for maximum matchings and the fastest mixing Markov chain,
Linear Time Average Consensus and Distributed Optimization on Fixed Graphs,
Primal-dual interior-point algorithm for symmetric model predictive control,
Safe Metropolis-Hastings algorithm and its application to swarm control,
Geometric bounds on the fastest mixing Markov chain,
Group symmetry and covariance regularization,
The geometric properties of a class of nonsymmetric cones,
Finding the projection onto the intersection of a closed half-space and a variable box,
Improved mixing rates of directed cycles by added connection,
Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices,
Fast algorithm for singly linearly constrained quadratic programs with box-like constraints,
Markov chain mixing time on cycles,
Characterizing limits and opportunities in speeding up Markov chain mixing,
Markov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents,
Structure of hierarchical linear systems with cyclic symmetry,
Fundamental Domains for Symmetric Optimization: Construction and Search,
The complete positivity of symmetric tridiagonal and pentadiagonal matrices,
Random Walks, Directed Cycles, and Markov Chains,
Fastest random walk on a path
