Arithmetic modeling of random processes and \(r\)-algorithms
From MaRDI portal
Publication:380647
DOI10.1007/s10559-012-9388-9zbMath1306.90149OpenAlexW2047386774MaRDI QIDQ380647
Publication date: 14 November 2013
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-012-9388-9
nondifferentiable optimizationmatrix optimization\(r\)-algorithmstochastic approximation of a random processuniform distribution with prescribed density
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of semidefinite programming for sensor network localization
- A family of Calabi-Yau varieties and potential automorphy
- Automorphy for some \(l\)-adic lifts of automorphic mod \(l\) Galois representations. With Appendix A, summarizing unpublished work of Russ Mann, and Appendix B by Marie-France Vignéras.
- On an analogue of the Sato conjecture
- Estimation of the mean and the covariance matrix under a marginal independence assumption -- an application of matrix differential calculus
- Nondifferentiable optimization and polynomial problems
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- Ergodic theory and arithmetical simulation of random processes
- Exact matrix completion via convex optimization
- Investigation of optimization methods and their applications
- Gauss Sums, Kloosterman Sums, and Monodromy Groups. (AM-116)
- Methods to find the most preferred element on a set of Pareto-optimal decisions
- On the distribution of angles of Kloosterman sums.
- Sparsity and incoherence in compressive sampling
- How the Number of Points of An Elliptic Curve Over a Fixed Prime Field Varies
- Problems in the theory of automorphic forms to Salomon Bochner in gratitude
- Compressed sensing
