Auswahl der wissenschaftlichen Literatur zum Thema „Randomized iterative methods“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Randomized iterative methods" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Randomized iterative methods"
Gower, Robert M., und Peter Richtárik. „Randomized Iterative Methods for Linear Systems“. SIAM Journal on Matrix Analysis and Applications 36, Nr. 4 (Januar 2015): 1660–90. http://dx.doi.org/10.1137/15m1025487.
Der volle Inhalt der QuelleLoizou, Nicolas, und Peter Richtárik. „Convergence Analysis of Inexact Randomized Iterative Methods“. SIAM Journal on Scientific Computing 42, Nr. 6 (Januar 2020): A3979—A4016. http://dx.doi.org/10.1137/19m125248x.
Der volle Inhalt der QuelleXing, Lili, Wendi Bao, Ying Lv, Zhiwei Guo und Weiguo Li. „Randomized Block Kaczmarz Methods for Inner Inverses of a Matrix“. Mathematics 12, Nr. 3 (02.02.2024): 475. http://dx.doi.org/10.3390/math12030475.
Der volle Inhalt der QuelleZhao, Jing, Xiang Wang und Jianhua Zhang. „Randomized average block iterative methods for solving factorised linear systems“. Filomat 37, Nr. 14 (2023): 4603–20. http://dx.doi.org/10.2298/fil2314603z.
Der volle Inhalt der QuelleZhang, Yanjun, und Hanyu Li. „Splitting-based randomized iterative methods for solving indefinite least squares problem“. Applied Mathematics and Computation 446 (Juni 2023): 127892. http://dx.doi.org/10.1016/j.amc.2023.127892.
Der volle Inhalt der QuelleYunak, O., M. Klymash, O. Shpur und V. Mrak. „MATHEMATICAL MODEL OF FRACTAL STRUCTURES RECOGNITION USING NEURAL NETWORK TECHNOLOGY“. Information and communication technologies, electronic engineering 3, Nr. 1 (Juni 2023): 1–9. http://dx.doi.org/10.23939/ictee2023.01.001.
Der volle Inhalt der QuelleSabelfeld, Karl K. „Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations“. Monte Carlo Methods and Applications 28, Nr. 2 (31.05.2022): 125–33. http://dx.doi.org/10.1515/mcma-2022-2114.
Der volle Inhalt der QuellePopkov, Yuri S., Yuri A. Dubnov und Alexey Yu Popkov. „Reinforcement Procedure for Randomized Machine Learning“. Mathematics 11, Nr. 17 (23.08.2023): 3651. http://dx.doi.org/10.3390/math11173651.
Der volle Inhalt der QuelleXing, Lili, Wendi Bao und Weiguo Li. „On the Convergence of the Randomized Block Kaczmarz Algorithm for Solving a Matrix Equation“. Mathematics 11, Nr. 21 (05.11.2023): 4554. http://dx.doi.org/10.3390/math11214554.
Der volle Inhalt der QuelleShcherbakova, Elena M., Sergey A. Matveev, Alexander P. Smirnov und Eugene E. Tyrtyshnikov. „Study of performance of low-rank nonnegative tensor factorization methods“. Russian Journal of Numerical Analysis and Mathematical Modelling 38, Nr. 4 (01.08.2023): 231–39. http://dx.doi.org/10.1515/rnam-2023-0018.
Der volle Inhalt der QuelleDissertationen zum Thema "Randomized iterative methods"
Gower, Robert Mansel. „Sketch and project : randomized iterative methods for linear systems and inverting matrices“. Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/20989.
Der volle Inhalt der QuelleBai, Xianglan. „Non-Krylov Non-iterative Subspace Methods For Linear Discrete Ill-posed Problems“. Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1627042947894919.
Der volle Inhalt der QuelleUGWU, UGOCHUKWU OBINNA. „Iterative tensor factorization based on Krylov subspace-type methods with applications to image processing“. Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1633531487559183.
Der volle Inhalt der QuelleGazagnadou, Nidham. „Expected smoothness for stochastic variance-reduced methods and sketch-and-project methods for structured linear systems“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT035.
Der volle Inhalt der QuelleThe considerable increase in the number of data and features complicates the learning phase requiring the minimization of a loss function. Stochastic gradient descent (SGD) and variance reduction variants (SAGA, SVRG, MISO) are widely used to solve this problem. In practice, these methods are accelerated by computing these stochastic gradients on a "mini-batch": a small group of samples randomly drawn.Indeed, recent technological improvements allowing the parallelization of these calculations have generalized the use of mini-batches.In this thesis, we are interested in the study of variants of stochastic gradient algorithms with reduced variance by trying to find the optimal hyperparameters: step and mini-batch size. Our study allows us to give convergence results interpolating between stochastic methods drawing a single sample per iteration and the so-called "full-batch" gradient descent using all samples at each iteration. Our analysis is based on the expected smoothness constant which allows to capture the regularity of the random function whose gradient is calculated.We study another class of optimization algorithms: the "sketch-and-project" methods. These methods can also be applied as soon as the learning problem boils down to solving a linear system. This is the case of ridge regression. We analyze here variants of this method that use different strategies of momentum and acceleration. These methods also depend on the sketching strategy used to compress the information of the system to be solved at each iteration. Finally, we show that these methods can also be extended to numerical analysis problems. Indeed, the extension of sketch-and-project methods to Alternating-Direction Implicit (ADI) methods allows to apply them to large-scale problems, when the so-called "direct" solvers are too slow
Wu, Wei. „Paving the Randomized Gauss-Seidel“. Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/scripps_theses/1074.
Der volle Inhalt der QuelleBuchteile zum Thema "Randomized iterative methods"
Azzam, Joy, Benjamin W. Ong und Allan A. Struthers. „Randomized Iterative Methods for Matrix Approximation“. In Machine Learning, Optimization, and Data Science, 226–40. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95470-3_17.
Der volle Inhalt der QuelleZhao, Xuefang. „A Randomized Iterative Approach for SV Discovery with SVelter“. In Methods in Molecular Biology, 169–77. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4939-8666-8_13.
Der volle Inhalt der QuelleMárquez, Airam Expósito, und Christopher Expósito-Izquierdo. „An Overview of the Last Advances and Applications of Greedy Randomized Adaptive Search Procedure“. In Advances in Computational Intelligence and Robotics, 264–84. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2857-9.ch013.
Der volle Inhalt der QuelleInchausti, Pablo. „The Generalized Linear Model“. In Statistical Modeling With R, 189–200. Oxford University PressOxford, 2022. http://dx.doi.org/10.1093/oso/9780192859013.003.0008.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Randomized iterative methods"
Ding, Liyong, Enbin Song und Yunmin Zhu. „Accelerate randomized coordinate descent iterative hard thresholding methods for ℓ0 regularized convex problems“. In 2016 35th Chinese Control Conference (CCC). IEEE, 2016. http://dx.doi.org/10.1109/chicc.2016.7553791.
Der volle Inhalt der QuelleCarr, Steven, Nils Jansen und Ufuk Topcu. „Verifiable RNN-Based Policies for POMDPs Under Temporal Logic Constraints“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/570.
Der volle Inhalt der QuelleJahani, Nazanin, Joaquín Ambía, Kristian Fossum, Sergey Alyaev, Erich Suter und Carlos Torres-Verdín. „REAL-TIME ENSEMBLE-BASED WELL-LOG INTERPRETATION FOR GEOSTEERING“. In 2021 SPWLA 62nd Annual Logging Symposium Online. Society of Petrophysicists and Well Log Analysts, 2021. http://dx.doi.org/10.30632/spwla-2021-0105.
Der volle Inhalt der QuelleWei He, Hongyan Zhang, Liangpei Zhang und Huanfeng Shen. „A noise-adjusted iterative randomized singular value decomposition method for hyperspectral image denoising“. In IGARSS 2014 - 2014 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2014. http://dx.doi.org/10.1109/igarss.2014.6946731.
Der volle Inhalt der QuelleFeng, Xu, und Wenjian Yu. „A Fast Adaptive Randomized PCA Algorithm“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/411.
Der volle Inhalt der QuelleKaushik, Harshal, und Farzad Yousefian. „A Randomized Block Coordinate Iterative Regularized Subgradient Method for High-dimensional Ill-posed Convex Optimization“. In 2019 American Control Conference (ACC). IEEE, 2019. http://dx.doi.org/10.23919/acc.2019.8815256.
Der volle Inhalt der QuelleBuermann, Jan, und Jie Zhang. „Multi-Robot Adversarial Patrolling Strategies via Lattice Paths“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/582.
Der volle Inhalt der QuelleXie, Jiarui, Chonghui Zhang, Lijun Sun und Yaoyao Fiona Zhao. „Fairness- and Uncertainty-Aware Data Generation for Data-Driven Design“. In ASME 2023 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/detc2023-114687.
Der volle Inhalt der QuelleGao, Guohua, Horacio Florez, Sean Jost, Shakir Shaikh, Kefei Wang, Jeroen Vink, Carl Blom, Terence Wells und Fredrik Saaf. „Implementation of Asynchronous Distributed Gauss-Newton Optimization Algorithms for Uncertainty Quantification by Conditioning to Production Data“. In SPE Annual Technical Conference and Exhibition. SPE, 2022. http://dx.doi.org/10.2118/210118-ms.
Der volle Inhalt der QuellePITZ, EMIL, SEAN ROONEY und KISHORE POCHIRAJU. „MODELING AND CALIBRATION OF UNCERTAINTY IN MATERIAL PROPERTIES OF ADDITIVELY MANUFACTURED COMPOSITES“. In Thirty-sixth Technical Conference. Destech Publications, Inc., 2021. http://dx.doi.org/10.12783/asc36/35758.
Der volle Inhalt der Quelle