Halldórsson, Magnús M.; Ishii, Toshimasa; Makino, Kazuhisa; Takazawa, Kenjiro Posimodular function optimization. (English) Zbl 1491.68088 Algorithmica 84, No. 4, 1107-1131 (2022). MSC: 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Algorithmica 84, No. 4, 1107--1131 (2022; Zbl 1491.68088) Full Text: DOI
Diatta, Daouda Niang; Diatta, Sény; Rouillier, Fabrice; Roy, Marie-Françoise; Sagraloff, Michael Bounds for polynomials on algebraic numbers and application to curve topology. (English) Zbl 1486.14074 Discrete Comput. Geom. 67, No. 3, 631-697 (2022). Reviewer: Alexander Kovačec (Coimbra) MSC: 14P25 68W30 13P15 14Q05 68Q25 14H50 PDFBibTeX XMLCite \textit{D. N. Diatta} et al., Discrete Comput. Geom. 67, No. 3, 631--697 (2022; Zbl 1486.14074) Full Text: DOI arXiv
Kontogiannis, Spyros; Wagner, Dorothea; Zaroliagis, Christos An axiomatic approach to time-dependent shortest path oracles. (English) Zbl 1485.05044 Algorithmica 84, No. 3, 815-870 (2022). MSC: 05C12 05C85 05C38 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Kontogiannis} et al., Algorithmica 84, No. 3, 815--870 (2022; Zbl 1485.05044) Full Text: DOI
Gibney, Daniel; Thankachan, Sharma V. On the complexity of recognizing Wheeler graphs. (English) Zbl 1518.68075 Algorithmica 84, No. 3, 784-814 (2022). MSC: 68P05 68P30 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{D. Gibney} and \textit{S. V. Thankachan}, Algorithmica 84, No. 3, 784--814 (2022; Zbl 1518.68075) Full Text: DOI
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I. Safety in \(s\)-\(t\) paths, trails and walks. (English) Zbl 1518.68251 Algorithmica 84, No. 3, 719-741 (2022). MSC: 68R10 05C20 05C38 05C40 05C85 68Q25 92D10 PDFBibTeX XMLCite \textit{M. Cairo} et al., Algorithmica 84, No. 3, 719--741 (2022; Zbl 1518.68251) Full Text: DOI arXiv
Klimm, Max; Pfetsch, Marc E.; Raber, Rico; Skutella, Martin Packing under convex quadratic constraints. (English) Zbl 1489.90157 Math. Program. 192, No. 1-2 (B), 361-386 (2022). MSC: 90C27 90C35 68Q25 PDFBibTeX XMLCite \textit{M. Klimm} et al., Math. Program. 192, No. 1--2 (B), 361--386 (2022; Zbl 1489.90157) Full Text: DOI
Hartmann, Tim A.; Lendl, Stefan; Woeginger, Gerhard J. Continuous facility location on graphs. (English) Zbl 1489.90155 Math. Program. 192, No. 1-2 (B), 207-227 (2022). MSC: 90C27 68Q25 05C85 PDFBibTeX XMLCite \textit{T. A. Hartmann} et al., Math. Program. 192, No. 1--2 (B), 207--227 (2022; Zbl 1489.90155) Full Text: DOI
Anegg, Georg; Angelidakis, Haris; Kurpisz, Adam; Zenklusen, Rico A technique for obtaining true approximations for \(k\)-center with covering constraints. (English) Zbl 1489.90146 Math. Program. 192, No. 1-2 (B), 3-27 (2022). MSC: 90C27 68W40 68Q25 PDFBibTeX XMLCite \textit{G. Anegg} et al., Math. Program. 192, No. 1--2 (B), 3--27 (2022; Zbl 1489.90146) Full Text: DOI
Bernstein, Aaron; Disser, Yann; Groß, Martin; Himburg, Sandra General bounds for incremental maximization. (English) Zbl 07495406 Math. Program. 191, No. 2 (A), 953-979 (2022). MSC: 68W27 68W25 90C27 68Q25 PDFBibTeX XMLCite \textit{A. Bernstein} et al., Math. Program. 191, No. 2 (A), 953--979 (2022; Zbl 07495406) Full Text: DOI
Driggs, Derek; Ehrhardt, Matthias J.; Schönlieb, Carola-Bibiane Accelerating variance-reduced stochastic gradient methods. (English) Zbl 1489.90113 Math. Program. 191, No. 2 (A), 671-715 (2022). MSC: 90C25 90C15 90C60 68Q25 90C06 PDFBibTeX XMLCite \textit{D. Driggs} et al., Math. Program. 191, No. 2 (A), 671--715 (2022; Zbl 1489.90113) Full Text: DOI arXiv
Ahadi, Arash; Mollahajiaghaei, Mohsen; Dehghan, Ali On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard. (English) Zbl 1485.05124 Graphs Comb. 38, No. 3, Paper No. 52, 18 p. (2022). MSC: 05C69 68Q25 03D15 05A17 05C25 05C50 PDFBibTeX XMLCite \textit{A. Ahadi} et al., Graphs Comb. 38, No. 3, Paper No. 52, 18 p. (2022; Zbl 1485.05124) Full Text: DOI arXiv
Carlet, Claude; Mesnager, Sihem On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets. (English) Zbl 1492.11061 J. Algebr. Comb. 55, No. 1, 43-59 (2022). Reviewer: Guillermo Morales Luna (Ciudad de México) MSC: 11B75 11B30 68Q25 94D10 94A60 PDFBibTeX XMLCite \textit{C. Carlet} and \textit{S. Mesnager}, J. Algebr. Comb. 55, No. 1, 43--59 (2022; Zbl 1492.11061) Full Text: DOI
Dvořák, Pavel; Knop, Dušan; Toufar, Tomáš Target set selection in dense graph classes. (English) Zbl 07489482 SIAM J. Discrete Math. 36, No. 1, 536-572 (2022). MSC: 68Q25 68Q27 PDFBibTeX XMLCite \textit{P. Dvořák} et al., SIAM J. Discrete Math. 36, No. 1, 536--572 (2022; Zbl 07489482) Full Text: DOI arXiv
Bérczi, Kristóf; Boros, Endre; Čepek, Ondřej; Kučera, Petr; Makino, Kazuhisa Approximating minimum representations of key Horn functions. (English) Zbl 1504.68052 SIAM J. Comput. 51, No. 1, 116-138 (2022). MSC: 68P15 03B05 05C65 06E30 68Q25 68W25 PDFBibTeX XMLCite \textit{K. Bérczi} et al., SIAM J. Comput. 51, No. 1, 116--138 (2022; Zbl 1504.68052) Full Text: DOI arXiv
Trotta, Manuel; Archetti, Claudia; Feillet, Dominique; Quilliot, Alain Pickup and delivery problems with autonomous vehicles on rings. (English) Zbl 1495.90033 Eur. J. Oper. Res. 300, No. 1, 221-236 (2022). MSC: 90B06 68Q25 90C35 90C60 PDFBibTeX XMLCite \textit{M. Trotta} et al., Eur. J. Oper. Res. 300, No. 1, 221--236 (2022; Zbl 1495.90033) Full Text: DOI HAL
Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 1495.90226 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90C35 90C15 90C27 68Q25 PDFBibTeX XMLCite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 1495.90226) Full Text: DOI
Agnetis, Alessandro; Benini, Mario; Detti, Paolo; Hermans, Ben; Pranzo, Marco Replication and sequencing of unreliable jobs on parallel machines. (English) Zbl 1511.90154 Comput. Oper. Res. 139, Article ID 105634, 9 p. (2022). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{A. Agnetis} et al., Comput. Oper. Res. 139, Article ID 105634, 9 p. (2022; Zbl 1511.90154) Full Text: DOI
Györgyi, Péter; Kis, Tamás New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. (English) Zbl 1483.90056 Discrete Appl. Math. 311, 97-109 (2022). MSC: 90B35 68Q25 68W25 PDFBibTeX XMLCite \textit{P. Györgyi} and \textit{T. Kis}, Discrete Appl. Math. 311, 97--109 (2022; Zbl 1483.90056) Full Text: DOI arXiv
Leimkuhler, Benedict; Sachs, Matthias Efficient numerical algorithms for the generalized Langevin equation. (English) Zbl 07482209 SIAM J. Sci. Comput. 44, No. 1, A364-A388 (2022). MSC: 68Q25 68R10 68U05 PDFBibTeX XMLCite \textit{B. Leimkuhler} and \textit{M. Sachs}, SIAM J. Sci. Comput. 44, No. 1, A364--A388 (2022; Zbl 07482209) Full Text: DOI arXiv
Schellekens, M. P. Entropy conservation for comparison-based algorithms. (English) Zbl 07481216 Topology Appl. 309, Article ID 107913, 21 p. (2022). MSC: 68P10 68Q25 06A06 68P05 68W40 94A17 68Q55 PDFBibTeX XMLCite \textit{M. P. Schellekens}, Topology Appl. 309, Article ID 107913, 21 p. (2022; Zbl 07481216) Full Text: DOI arXiv
Mustafa, Nabil H. Sampling in combinatorial and geometric set systems. (English) Zbl 1489.68003 Mathematical Surveys and Monographs 265. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-6156-0/pbk; 978-1-4704-6873-6/ebook). xv, 251 p. (2022). MSC: 68-01 05-01 52-01 60-01 62-01 05D40 11K38 52C45 62D05 68Q25 68Q87 68T05 PDFBibTeX XMLCite \textit{N. H. Mustafa}, Sampling in combinatorial and geometric set systems. Providence, RI: American Mathematical Society (AMS) (2022; Zbl 1489.68003) Full Text: DOI
Mahmood, Yasir; Meier, Arne Parameterised complexity of model checking and satisfiability in propositional dependence logic. (English) Zbl 07473202 Ann. Math. Artif. Intell. 90, No. 2-3, 271-296 (2022). MSC: 68Q25 03B70 PDFBibTeX XMLCite \textit{Y. Mahmood} and \textit{A. Meier}, Ann. Math. Artif. Intell. 90, No. 2--3, 271--296 (2022; Zbl 07473202) Full Text: DOI arXiv
Li, Xin; Lovett, Shachar; Zhang, Jiapeng Sunflowers and robust sunflowers from randomness extractors. (English) Zbl 07471590 Theory Comput. 18, Paper No. 2, 18 p. (2022). MSC: 68Qxx 05D10 68Q17 68Q25 PDFBibTeX XMLCite \textit{X. Li} et al., Theory Comput. 18, Paper No. 2, 18 p. (2022; Zbl 07471590) Full Text: DOI
Drucker, Andrew (ed.) Special issue: RANDOM 2018: Guest editor’s foreword. (English) Zbl 07471589 Theory Comput. 18, Paper No. 1, 3 p. (2022). MSC: 00B25 68Q25 PDFBibTeX XMLCite \textit{A. Drucker} (ed.), Theory Comput. 18, Paper No. 1, 3 p. (2022; Zbl 07471589) Full Text: DOI
Kiefer, Sandra; Neuen, Daniel The power of the Weisfeiler-Leman algorithm to decompose graphs. (English) Zbl 1493.68273 SIAM J. Discrete Math. 36, No. 1, 252-298 (2022). Reviewer: Zhizhang Shen (Plymouth) MSC: 68R10 05C10 05C60 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Kiefer} and \textit{D. Neuen}, SIAM J. Discrete Math. 36, No. 1, 252--298 (2022; Zbl 1493.68273) Full Text: DOI arXiv
Carbonnel, Clément; Romero, Miguel; Živný, Stanislav The complexity of general-valued constraint satisfaction problems seen from the other side. (English) Zbl 07470541 SIAM J. Comput. 51, No. 1, 19-69 (2022). MSC: 68Q25 68R01 03B70 90C05 PDFBibTeX XMLCite \textit{C. Carbonnel} et al., SIAM J. Comput. 51, No. 1, 19--69 (2022; Zbl 07470541) Full Text: DOI arXiv
Chen, Chen; Tong, Hanghang Network connectivity. Concepts, computation, and optimization. (English) Zbl 1481.68006 Synthesis Lectures on Learning, Networks, and Algorithms 28. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-63639-295-0; 978-1-63639-296-7/ebook). xiii, 151 p. (2022). MSC: 68-02 05C40 05C82 68Q25 68R10 68T05 68W25 90B10 90C35 90C59 PDFBibTeX XMLCite \textit{C. Chen} and \textit{H. Tong}, Network connectivity. Concepts, computation, and optimization. San Rafael, CA: Morgan \& Claypool Publishers (2022; Zbl 1481.68006) Full Text: DOI
Bandyapadhyay, Sayan On perturbation resilience of non-uniform \(k\)-center. (English) Zbl 1522.68628 Algorithmica 84, No. 1, 13-36 (2022). MSC: 68U05 68Q25 68W25 PDFBibTeX XMLCite \textit{S. Bandyapadhyay}, Algorithmica 84, No. 1, 13--36 (2022; Zbl 1522.68628) Full Text: DOI arXiv
Chang, Mun See; Roney-Dougal, Colva M. Primitive normalisers in quasipolynomial time. (English) Zbl 1511.20005 Arch. Math. 118, No. 1, 19-25 (2022). Reviewer: Cindy Tsang (Tokyo) MSC: 20-08 20B35 68W30 20B15 68Q25 PDFBibTeX XMLCite \textit{M. S. Chang} and \textit{C. M. Roney-Dougal}, Arch. Math. 118, No. 1, 19--25 (2022; Zbl 1511.20005) Full Text: DOI arXiv
Wu, Xiaoqun; Mao, Bing; Wu, Xiuqi; Lu, Jinhu Dynamic event-triggered leader-follower consensus control for multiagent systems. (English) Zbl 07465745 SIAM J. Control Optim. 60, No. 1, 189-209 (2022). MSC: 68Q25 68R10 68U05 PDFBibTeX XMLCite \textit{X. Wu} et al., SIAM J. Control Optim. 60, No. 1, 189--209 (2022; Zbl 07465745) Full Text: DOI
Qian, Jin; Han, Haiyan Improved algorithms for proportionate flow shop scheduling with due-window assignment. (English) Zbl 1480.90141 Ann. Oper. Res. 309, No. 1, 249-258 (2022). MSC: 90B35 90C59 68Q25 PDFBibTeX XMLCite \textit{J. Qian} and \textit{H. Han}, Ann. Oper. Res. 309, No. 1, 249--258 (2022; Zbl 1480.90141) Full Text: DOI
Novak, Antonin; Hanzalek, Zdenek Computing the execution probability of jobs with replication in mixed-criticality schedules. (English) Zbl 1480.90138 Ann. Oper. Res. 309, No. 1, 209-232 (2022). MSC: 90B35 68M20 68Q25 90C59 90B36 PDFBibTeX XMLCite \textit{A. Novak} and \textit{Z. Hanzalek}, Ann. Oper. Res. 309, No. 1, 209--232 (2022; Zbl 1480.90138) Full Text: DOI
Brust, Johannes J.; Marcia, Roummel F.; Petra, Cosmin G.; Saunders, Michael A. Large-scale optimization with linear equality constraints using reduced compact representation. (English) Zbl 07459362 SIAM J. Sci. Comput. 44, No. 1, A103-A127 (2022). MSC: 68Q25 68R10 68U05 PDFBibTeX XMLCite \textit{J. J. Brust} et al., SIAM J. Sci. Comput. 44, No. 1, A103--A127 (2022; Zbl 07459362) Full Text: DOI arXiv
Tang, Qinglin; Xie, Manting; Zhang, Yong; Zhang, Yuqing A spectrally accurate numerical method for computing the Bogoliubov-de Gennes excitations of dipolar Bose-Einstein condensates. (English) Zbl 1484.65273 SIAM J. Sci. Comput. 44, No. 1, B100-B121 (2022). MSC: 65M70 68Q25 65T50 65R20 65F15 82C10 82D05 35Q82 PDFBibTeX XMLCite \textit{Q. Tang} et al., SIAM J. Sci. Comput. 44, No. 1, B100--B121 (2022; Zbl 1484.65273) Full Text: DOI
Bosek, Bartłomiej; Leniowski, Dariusz; Sankowski, Piotr; Zych-Pawlewicz, Anna A tight bound for shortest augmenting paths on trees. (English) Zbl 1486.68124 Theor. Comput. Sci. 901, 45-61 (2022). MSC: 68R10 68Q25 68W27 PDFBibTeX XMLCite \textit{B. Bosek} et al., Theor. Comput. Sci. 901, 45--61 (2022; Zbl 1486.68124) Full Text: DOI arXiv
Alsuwaiyel, M. H. Algorithms. Design techniques and analysis. 2nd edition. (English) Zbl 1478.68002 Lecture Notes Series on Computing 15. Singapore: World Scientific (ISBN 978-981-12-3864-2/hbk; 978-981-12-3866-6/ebook). xxix, 725 p. (2022). MSC: 68-01 68Q25 68Wxx PDFBibTeX XMLCite \textit{M. H. Alsuwaiyel}, Algorithms. Design techniques and analysis. 2nd edition. Singapore: World Scientific (2022; Zbl 1478.68002) Full Text: DOI
Barbero, Stefano; Bellini, Emanuele; Sanna, Carlo; Verbel, Javier Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. (English) Zbl 07456377 Discrete Appl. Math. 309, 13-31 (2022). MSC: 68Wxx 11T06 11Y16 94D10 68Q25 PDFBibTeX XMLCite \textit{S. Barbero} et al., Discrete Appl. Math. 309, 13--31 (2022; Zbl 07456377) Full Text: DOI
Bonomo-Braberman, Flavia; Mazzoleni, María Pía; Rean, Mariano Leonardo; Ries, Bernard On some special classes of contact \(B_0\)-VPG graphs. (English) Zbl 1479.05307 Discrete Appl. Math. 308, 111-129 (2022). MSC: 05C75 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 308, 111--129 (2022; Zbl 1479.05307) Full Text: DOI arXiv
Al-Herz, Ahmed; Pothen, Alex A \(2/3\)-approximation algorithm for vertex-weighted matching. (English) Zbl 1479.05293 Discrete Appl. Math. 308, 46-67 (2022). MSC: 05C70 05C22 05C85 68W25 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Al-Herz} and \textit{A. Pothen}, Discrete Appl. Math. 308, 46--67 (2022; Zbl 1479.05293) Full Text: DOI arXiv
Beltramo, Gabriele; Skraba, Primoz Persistent homology in \(\ell_\infty\) metric. (English) Zbl 1500.55003 Comput. Geom. 101, Article ID 101821, 28 p. (2022). Reviewer: Sang-Eon Han (Jeonju) MSC: 55N31 68U05 68Q25 55N35 57Q05 55U10 PDFBibTeX XMLCite \textit{G. Beltramo} and \textit{P. Skraba}, Comput. Geom. 101, Article ID 101821, 28 p. (2022; Zbl 1500.55003) Full Text: DOI arXiv
Ködmön, Csenge Lili; Lángi, Zsolt Extremal convex polygons inscribed in a given convex polygon. (English) Zbl 1479.52005 Comput. Geom. 102, Article ID 101844, 10 p. (2022). MSC: 52A10 68Q25 52A20 37D40 52-04 PDFBibTeX XMLCite \textit{C. L. Ködmön} and \textit{Z. Lángi}, Comput. Geom. 102, Article ID 101844, 10 p. (2022; Zbl 1479.52005) Full Text: DOI arXiv
Radermacher, Marcel; Rutter, Ignaz Inserting an edge into a geometric embedding. (English) Zbl 1483.68261 Comput. Geom. 102, Article ID 101843, 15 p. (2022). Reviewer: Xueliang Li (Tianjin) MSC: 68R10 05C10 05C62 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{M. Radermacher} and \textit{I. Rutter}, Comput. Geom. 102, Article ID 101843, 15 p. (2022; Zbl 1483.68261) Full Text: DOI arXiv
Dehghan, Ali; Ahadi, Arash On the proper arc labeling of directed graphs. (English) Zbl 1480.05110 Graphs Comb. 38, No. 1, Paper No. 1, 19 p. (2022). Reviewer: P. Jeyanthi (Tiruchendur) MSC: 05C78 05C20 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Dehghan} and \textit{A. Ahadi}, Graphs Comb. 38, No. 1, Paper No. 1, 19 p. (2022; Zbl 1480.05110) Full Text: DOI
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka Upper and lower degree-constrained graph orientation with minimum penalty. (English) Zbl 1515.68222 Theor. Comput. Sci. 900, 53-78 (2022). MSC: 68R10 05C20 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 900, 53--78 (2022; Zbl 1515.68222) Full Text: DOI
Moscarini, Marina Computing a metric basis of a bipartite distance-hereditary graph. (English) Zbl 1518.05051 Theor. Comput. Sci. 900, 20-24 (2022). MSC: 05C12 68Q25 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 900, 20--24 (2022; Zbl 1518.05051) Full Text: DOI
Bérard, Béatrice; Haddad, Serge Corrigendum to: “Revisiting reachability in polynomial interrupt timed automata”. (English) Zbl 1483.68158 Inf. Process. Lett. 175, Article ID 106231, 1 p. (2022). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{B. Bérard} and \textit{S. Haddad}, Inf. Process. Lett. 175, Article ID 106231, 1 p. (2022; Zbl 1483.68158) Full Text: DOI
Bérard, Béatrice; Haddad, Serge Revisiting reachability in polynomial interrupt timed automata. (English) Zbl 1483.68157 Inf. Process. Lett. 174, Article ID 106208, 6 p. (2022); corrigendum ibid. 175, Article ID 106231, 1 p. (2022). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{B. Bérard} and \textit{S. Haddad}, Inf. Process. Lett. 174, Article ID 106208, 6 p. (2022; Zbl 1483.68157) Full Text: DOI
Amendola, Giovanni; Greco, Gianluigi; Veltri, Pierfrancesco Answers set programs for non-transferable utility games: expressiveness, complexity and applications. (English) Zbl 1478.68380 Artif. Intell. 302, Article ID 103606, 44 p. (2022). MSC: 68T42 68N17 68Q25 68T30 91A12 91A30 PDFBibTeX XMLCite \textit{G. Amendola} et al., Artif. Intell. 302, Article ID 103606, 44 p. (2022; Zbl 1478.68380) Full Text: DOI
Almethen, Abdullah; Michail, Othon; Potapov, Igor On efficient connectivity-preserving transformations in a grid. (English) Zbl 1478.68375 Theor. Comput. Sci. 898, 132-148 (2022). MSC: 68T40 68Q09 68Q10 68Q25 68U05 68W15 PDFBibTeX XMLCite \textit{A. Almethen} et al., Theor. Comput. Sci. 898, 132--148 (2022; Zbl 1478.68375) Full Text: DOI arXiv
Tale, Prafullkumar Sparsification lower bound for linear spanners in directed graphs. (English) Zbl 1478.68264 Theor. Comput. Sci. 898, 69-74 (2022). MSC: 68R10 05C12 05C20 68Q25 PDFBibTeX XMLCite \textit{P. Tale}, Theor. Comput. Sci. 898, 69--74 (2022; Zbl 1478.68264) Full Text: DOI arXiv
Kern, Walter; Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07437224 Theor. Comput. Sci. 898, 59-68 (2022). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{W. Kern} et al., Theor. Comput. Sci. 898, 59--68 (2022; Zbl 07437224) Full Text: DOI arXiv
Pardo, Luis M.; Sebastián, Daniel A promenade through correct test sequences. I: Degree of constructible sets, Bézout’s inequality and density. (English) Zbl 1482.68280 J. Complexity 68, Article ID 101588, 92 p. (2022). Reviewer: Amir Hashemi (Isfahan) MSC: 68W30 12E05 13F20 13P15 14Q20 68Q25 68W20 68W40 PDFBibTeX XMLCite \textit{L. M. Pardo} and \textit{D. Sebastián}, J. Complexity 68, Article ID 101588, 92 p. (2022; Zbl 1482.68280) Full Text: DOI arXiv
Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin Efficiently enumerating hitting sets of hypergraphs arising in data profiling. (English) Zbl 1478.68219 J. Comput. Syst. Sci. 124, 192-213 (2022). MSC: 68R10 05C30 05C65 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Bläsius} et al., J. Comput. Syst. Sci. 124, 192--213 (2022; Zbl 1478.68219) Full Text: DOI Link
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI arXiv
Chan, Timothy M.; He, Qizheng More on change-making and related problems. (English) Zbl 1491.68126 J. Comput. Syst. Sci. 124, 159-169 (2022). Reviewer: Roberto Solis-Oba (London) MSC: 68R05 11D07 68Q25 68W05 68W32 68W40 90C27 90C39 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{Q. He}, J. Comput. Syst. Sci. 124, 159--169 (2022; Zbl 1491.68126) Full Text: DOI arXiv Link
Agrawal, Akanksha Fine-grained complexity of rainbow coloring and its variants. (English) Zbl 1481.68033 J. Comput. Syst. Sci. 124, 140-158 (2022). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68R10 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Agrawal}, J. Comput. Syst. Sci. 124, 140--158 (2022; Zbl 1481.68033) Full Text: DOI Link
Eisenbrand, Friedrich; Venzin, Moritz Approximate CVP\(_p\) in time \(2^{0.802n}\). (English) Zbl 1478.68449 J. Comput. Syst. Sci. 124, 129-139 (2022). MSC: 68W25 11Y16 68Q25 90C10 PDFBibTeX XMLCite \textit{F. Eisenbrand} and \textit{M. Venzin}, J. Comput. Syst. Sci. 124, 129--139 (2022; Zbl 1478.68449) Full Text: DOI arXiv
Vangerven, Bart; Briskorn, Dirk; Goossens, Dries R.; Spieksma, Frits C. R. Parliament seating assignment problems. (English) Zbl 1490.90297 Eur. J. Oper. Res. 296, No. 3, 914-926 (2022). MSC: 90C35 68Q25 90C11 90C59 PDFBibTeX XMLCite \textit{B. Vangerven} et al., Eur. J. Oper. Res. 296, No. 3, 914--926 (2022; Zbl 1490.90297) Full Text: DOI Link
Wang, Kai; Pesch, Erwin; Kress, Dominik; Fridman, Ilia; Boysen, Nils The piggyback transportation problem: transporting drones launched from a flying warehouse. (English) Zbl 1490.90138 Eur. J. Oper. Res. 296, No. 2, 504-519 (2022). MSC: 90B35 90B06 90C59 68Q25 PDFBibTeX XMLCite \textit{K. Wang} et al., Eur. J. Oper. Res. 296, No. 2, 504--519 (2022; Zbl 1490.90138) Full Text: DOI
Marino, Andrea; Silva, Ana Coloring temporal graphs. (English) Zbl 1472.68117 J. Comput. Syst. Sci. 123, 171-185 (2022). MSC: 68R10 05C15 68Q25 PDFBibTeX XMLCite \textit{A. Marino} and \textit{A. Silva}, J. Comput. Syst. Sci. 123, 171--185 (2022; Zbl 1472.68117) Full Text: DOI
Jeż, Artur Word equations in non-deterministic linear space. (English) Zbl 1472.68068 J. Comput. Syst. Sci. 123, 122-142 (2022). MSC: 68Q25 68P30 68Q45 PDFBibTeX XMLCite \textit{A. Jeż}, J. Comput. Syst. Sci. 123, 122--142 (2022; Zbl 1472.68068) Full Text: DOI Link
Frei, Fabian; Hemaspaandra, Edith; Rothe, Jörg Complexity of stability. (English) Zbl 1472.68113 J. Comput. Syst. Sci. 123, 103-121 (2022). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{F. Frei} et al., J. Comput. Syst. Sci. 123, 103--121 (2022; Zbl 1472.68113) Full Text: DOI arXiv
Figelius, Michael; Lohrey, Markus; Zetzsche, Georg Closure properties of knapsack semilinear groups. (English) Zbl 1512.20105 J. Algebra 589, 437-482 (2022). MSC: 20F10 20E22 20E06 68Q25 PDFBibTeX XMLCite \textit{M. Figelius} et al., J. Algebra 589, 437--482 (2022; Zbl 1512.20105) Full Text: DOI arXiv
Belgi, Amir; Nutov, Zeev A polylogarithmic approximation algorithm for 2-edge-connected dominating set. (English) Zbl 1476.05150 Inf. Process. Lett. 173, Article ID 106175, 5 p. (2022). MSC: 05C69 05C40 68W25 68Q25 PDFBibTeX XMLCite \textit{A. Belgi} and \textit{Z. Nutov}, Inf. Process. Lett. 173, Article ID 106175, 5 p. (2022; Zbl 1476.05150) Full Text: DOI
Tsur, Dekel Cluster deletion revisited. (English) Zbl 1476.05191 Inf. Process. Lett. 173, Article ID 106171, 9 p. (2022). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{D. Tsur}, Inf. Process. Lett. 173, Article ID 106171, 9 p. (2022; Zbl 1476.05191) Full Text: DOI arXiv
Hirai, Hiroshi On a manifold formulation of self-concordant functions. arXiv:2212.10981 Preprint, arXiv:2212.10981 [math.OC] (2022). MSC: 90C51 68Q25 BibTeX Cite \textit{H. Hirai}, ``On a manifold formulation of self-concordant functions'', Preprint, arXiv:2212.10981 [math.OC] (2022) Full Text: arXiv OA License
Schlotter, Ildikó; Sebő, András Odd Paths, Cycles and \(T\)-joins: Connections and Algorithms. arXiv:2211.12862 Preprint, arXiv:2211.12862 [cs.CC] (2022). MSC: 68Q17 05C85 05C12 68R10 68Q25 BibTeX Cite \textit{I. Schlotter} and \textit{A. Sebő}, ``Odd Paths, Cycles and $T$-joins: Connections and Algorithms'', Preprint, arXiv:2211.12862 [cs.CC] (2022) Full Text: arXiv OA License
Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. arXiv:2211.01723 Preprint, arXiv:2211.01723 [cs.LO] (2022). MSC: 05C83 05C85 68R10 68W01 68Q19 03C13 68Q25 68Q27 BibTeX Cite \textit{P. A. Golovach} et al., ``Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes'', Preprint, arXiv:2211.01723 [cs.LO] (2022) Full Text: arXiv OA License
Cui, Jinchuan; Li, Xiaoya A Polynomial-time Algorithm for the Large Scale of Aircraft Refueling Problem. arXiv:2210.11634 Preprint, arXiv:2210.11634 [cs.DS] (2022). MSC: 68Q25 68Q17 BibTeX Cite \textit{J. Cui} and \textit{X. Li}, ``A Polynomial-time Algorithm for the Large Scale of Aircraft Refueling Problem'', Preprint, arXiv:2210.11634 [cs.DS] (2022) Full Text: arXiv OA License
Hosseini, Alireza; Bredies, Kristian A Second-Order TGV Discretization with \(90^{\circ}\) Rotational Invariance Property. arXiv:2209.11450 Preprint, arXiv:2209.11450 [math.NA] (2022). MSC: 68Q25 68R10 68U05 BibTeX Cite \textit{A. Hosseini} and \textit{K. Bredies}, ``A Second-Order TGV Discretization with $90^{\circ}$ Rotational Invariance Property'', Preprint, arXiv:2209.11450 [math.NA] (2022) Full Text: arXiv OA License
Trunschke, Philipp Convergence bounds for local least squares approximation. arXiv:2208.10954 Preprint, arXiv:2208.10954 [math.NA] (2022). MSC: 15A69 41A30 62J02 65Y20 68Q25 BibTeX Cite \textit{P. Trunschke}, ``Convergence bounds for local least squares approximation'', Preprint, arXiv:2208.10954 [math.NA] (2022) Full Text: arXiv OA License
Heidari, Hanif; Hellstern, Gerhard Early heart disease prediction using hybrid quantum classification. arXiv:2208.08882 Preprint, arXiv:2208.08882 [quant-ph] (2022). MSC: 92C50 68P30 68Q87 68T20 68Q12 BibTeX Cite \textit{H. Heidari} and \textit{G. Hellstern}, ``Early heart disease prediction using hybrid quantum classification'', Preprint, arXiv:2208.08882 [quant-ph] (2022) Full Text: arXiv OA License
Beretta, Filippo; Dimino, Jesse; Fang, Weike; Martinez, Thomas C.; Miller, Steven J.; Stoll, Daniel On Benford’s Law and the Coefficients of the Riemann Mapping Function for the Exterior of the Mandelbrot Set. arXiv:2206.04112 Preprint, arXiv:2206.04112 [math.CV] (2022). MSC: 30B10 30C20 62P99 62-08 68Q25 BibTeX Cite \textit{F. Beretta} et al., ``On Benford's Law and the Coefficients of the Riemann Mapping Function for the Exterior of the Mandelbrot Set'', Preprint, arXiv:2206.04112 [math.CV] (2022) Full Text: DOI arXiv OA License
O’Sullivan, Cathal; Sorenson, Jonathan P.; Stahl, Aryn An Algorithm to Find Sums of Powers of Consecutive Primes. arXiv:2204.10930 Preprint, arXiv:2204.10930 [math.NT] (2022). MSC: 11A41 68Q25 BibTeX Cite \textit{C. O'Sullivan} et al., ``An Algorithm to Find Sums of Powers of Consecutive Primes'', Preprint, arXiv:2204.10930 [math.NT] (2022) Full Text: DOI arXiv OA License
Collins, Nathaniel A.; Levet, Michael Count-Free Weisfeiler–Leman and Group Isomorphism. arXiv:2212.11247 Preprint, arXiv:2212.11247 [cs.DS] (2022). MSC: 20-08 68Q17 68Q19 68Q25 20A15 BibTeX Cite \textit{N. A. Collins} and \textit{M. Levet}, ``Count-Free Weisfeiler--Leman and Group Isomorphism'', Preprint, arXiv:2212.11247 [cs.DS] (2022) Full Text: arXiv OA License
Rush, Cynthia; Skerman, Fiona; Wein, Alexander S.; Yang, Dana Is it easier to count communities than find them? arXiv:2212.10872 Preprint, arXiv:2212.10872 [math.ST] (2022). MSC: 05C80 62F03 68Q25 BibTeX Cite \textit{C. Rush} et al., ``Is it easier to count communities than find them?'', Preprint, arXiv:2212.10872 [math.ST] (2022) Full Text: arXiv OA License
Bacho, Aras; Boche, Holger; Kutyniok, Gitta Complexity Blowup for Solutions of the Laplace and the Diffusion Equation. arXiv:2212.00693 Preprint, arXiv:2212.00693 [cs.CC] (2022). MSC: 68Q15 68Q04 68Q17 68Q17 68Q25 35K05 35J05 BibTeX Cite \textit{A. Bacho} et al., ``Complexity Blowup for Solutions of the Laplace and the Diffusion Equation'', Preprint, arXiv:2212.00693 [cs.CC] (2022) Full Text: arXiv OA License
Przybyłowicz, Paweł; Schwarz, Verena; Szölgyenyi, Michaela Randomized Milstein algorithm for approximation of solutions of jump-diffusion SDEs. arXiv:2212.00411 Preprint, arXiv:2212.00411 [math.NA] (2022). MSC: 68Q25 65C30 60H10 BibTeX Cite \textit{P. Przybyłowicz} et al., ``Randomized Milstein algorithm for approximation of solutions of jump-diffusion SDEs'', Preprint, arXiv:2212.00411 [math.NA] (2022) Full Text: arXiv OA License
Goenka, Ritesh; Gupta, Eashan; Khyalia, Sushil; Agarwal, Pratyush; Wajid, Mulinti Shaik; Kalyanakrishnan, Shivaram Upper Bounds for All and Max-gain Policy Iteration Algorithms on Deterministic MDPs. arXiv:2211.15602 Preprint, arXiv:2211.15602 [cs.DM] (2022). MSC: 90C40 68Q25 05C35 05C38 BibTeX Cite \textit{R. Goenka} et al., ``Upper Bounds for All and Max-gain Policy Iteration Algorithms on Deterministic MDPs'', Preprint, arXiv:2211.15602 [cs.DM] (2022) Full Text: arXiv OA License
Liu, Hailiang; He, Jia-Hao; Tian, Xuping Anderson acceleration of gradient methods with energy for optimization problems. arXiv:2211.08578 Preprint, arXiv:2211.08578 [math.OC] (2022). MSC: 65K10 68Q25 BibTeX Cite \textit{H. Liu} et al., ``Anderson acceleration of gradient methods with energy for optimization problems'', Preprint, arXiv:2211.08578 [math.OC] (2022) Full Text: arXiv OA License
Azizian, Waïss; Iutzeler, Franck; Malick, Jérôme; Mertikopoulos, Panayotis The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness. arXiv:2211.08043 Preprint, arXiv:2211.08043 [math.OC] (2022). MSC: 65K15 90C33 68Q25 68Q32 BibTeX Cite \textit{W. Azizian} et al., ``The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness'', Preprint, arXiv:2211.08043 [math.OC] (2022) Full Text: arXiv OA License
Burichenko, Vladimir On automorphism group of a possible short algorithm for multiplication of \(3\times3\) matrices. arXiv:2211.06485 Preprint, arXiv:2211.06485 [cs.CC] (2022). MSC: 68Q25 20C99 BibTeX Cite \textit{V. Burichenko}, ``On automorphism group of a possible short algorithm for multiplication of $3\times3$ matrices'', Preprint, arXiv:2211.06485 [cs.CC] (2022) Full Text: arXiv OA License
Anegg, Georg; Koch, Laura Vargas; Zenklusen, Rico A Simple Combinatorial Algorithm for Robust Matroid Center. arXiv:2211.03601 Preprint, arXiv:2211.03601 [cs.DS] (2022). MSC: 90C27 68W40 68Q25 BibTeX Cite \textit{G. Anegg} et al., ``A Simple Combinatorial Algorithm for Robust Matroid Center'', Preprint, arXiv:2211.03601 [cs.DS] (2022) Full Text: arXiv OA License
Bodirsky, Manuel; Jonsson, Peter; Martin, Barnaby; Mottet, Antoine; Semanišinová, Žaneta Complexity Classification Transfer for CSPs via Algebraic Products. arXiv:2211.03340 Preprint, arXiv:2211.03340 [math.LO] (2022). MSC: 06A05 68Q25 08A70 BibTeX Cite \textit{M. Bodirsky} et al., ``Complexity Classification Transfer for CSPs via Algebraic Products'', Preprint, arXiv:2211.03340 [math.LO] (2022) Full Text: arXiv OA License
Dai, Yutong; Robinson, Daniel P. Inexact Proximal-Gradient Methods with Support Identification. arXiv:2211.02214 Preprint, arXiv:2211.02214 [math.OC] (2022). MSC: 49M29 49M37 65K05 65K10 65Y20 68Q25 90C30 90C60 BibTeX Cite \textit{Y. Dai} and \textit{D. P. Robinson}, ``Inexact Proximal-Gradient Methods with Support Identification'', Preprint, arXiv:2211.02214 [math.OC] (2022) Full Text: arXiv OA License
Giegrich, Michael; Reisinger, Christoph; Zhang, Yufei Convergence of policy gradient methods for finite-horizon exploratory linear-quadratic control problems. arXiv:2211.00617 Preprint, arXiv:2211.00617 [math.OC] (2022). MSC: 68Q25 93E20 BibTeX Cite \textit{M. Giegrich} et al., ``Convergence of policy gradient methods for finite-horizon exploratory linear-quadratic control problems'', Preprint, arXiv:2211.00617 [math.OC] (2022) Full Text: arXiv OA License
Burichenko, V. P. The isotropy group of the matrix multiplication tensor. arXiv:2210.16565 Preprint, arXiv:2210.16565 [cs.CC] (2022). MSC: 68Q25 20Cxx BibTeX Cite \textit{V. P. Burichenko}, ``The isotropy group of the matrix multiplication tensor'', Preprint, arXiv:2210.16565 [cs.CC] (2022) Full Text: arXiv OA License
Hoffman, Neil R; Petersen, Kathleen L Small \(\text{PSL}(2, \mathbb{F})\) representations of Seifert fiber space groups. arXiv:2209.05478 Preprint, arXiv:2209.05478 [math.GT] (2022). MSC: 57M50 68Q25 BibTeX Cite \textit{N. R Hoffman} and \textit{K. L Petersen}, ``Small $\text{PSL}(2, \mathbb{F})$ representations of Seifert fiber space groups'', Preprint, arXiv:2209.05478 [math.GT] (2022) Full Text: arXiv OA License
Morshed, Md Sarowar ALS: Augmented Lagrangian Sketching Methods for Linear Systems. arXiv:2208.06152 Preprint, arXiv:2208.06152 [math.OC] (2022). MSC: 15A06 15B52 49M37 65F10 65K05 65N75 65Y20 68Q25 68W20 68W40 90C30 90C51 BibTeX Cite \textit{M. S. Morshed}, ``ALS: Augmented Lagrangian Sketching Methods for Linear Systems'', Preprint, arXiv:2208.06152 [math.OC] (2022) Full Text: arXiv OA License
Sauer, Tomas; Stock, A. Michael Haar Wavelets, Gradients and Approximate TV Regularization. arXiv:2208.05389 Preprint, arXiv:2208.05389 [math.NA] (2022). MSC: 68Q25 68R10 68U05 BibTeX Cite \textit{T. Sauer} and \textit{A. M. Stock}, ``Haar Wavelets, Gradients and Approximate TV Regularization'', Preprint, arXiv:2208.05389 [math.NA] (2022) Full Text: arXiv OA License
Gokcesu, Hakan; Kozat, Suleyman S. Optimal Tracking in Prediction with Expert Advice. arXiv:2208.03708 Preprint, arXiv:2208.03708 [cs.LG] (2022). MSC: 68Q32 68T05 68Q25 BibTeX Cite \textit{H. Gokcesu} and \textit{S. S. Kozat}, ``Optimal Tracking in Prediction with Expert Advice'', Preprint, arXiv:2208.03708 [cs.LG] (2022) Full Text: arXiv OA License
Roulet, Vincent; Srinivasa, Siddhartha; Fazel, Maryam; Harchaoui, Zaid Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates. arXiv:2207.06362 Preprint, arXiv:2207.06362 [math.OC] (2022). MSC: 68Q25 49M37 BibTeX Cite \textit{V. Roulet} et al., ``Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates'', Preprint, arXiv:2207.06362 [math.OC] (2022) Full Text: arXiv OA License
Anegg, Georg; Koch, Laura Vargas; Zenklusen, Rico Techniques for Generalized Colorful \(k\)-Center Problems. arXiv:2207.02609 Preprint, arXiv:2207.02609 [cs.DS] (2022). MSC: 90C27 68W40 68Q25 BibTeX Cite \textit{G. Anegg} et al., ``Techniques for Generalized Colorful $k$-Center Problems'', Preprint, arXiv:2207.02609 [cs.DS] (2022) Full Text: arXiv OA License
Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. arXiv:2206.15092 Preprint, arXiv:2206.15092 [math.CO] (2022). MSC: 05C75 05C85 05C05 05C69 05C83 05C40 68Q25 BibTeX Cite \textit{C. Dallard} et al., ``Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure'', Preprint, arXiv:2206.15092 [math.CO] (2022) Full Text: arXiv OA License
Morshed, Md Sarowar Augmented Newton Method for Optimization: Global Linear Rate and Momentum Interpretation. arXiv:2205.11033 Preprint, arXiv:2205.11033 [math.OC] (2022). MSC: 49M15 49M37 58C15 65K05 65K10 65Y20 68Q25 90C06 90C30 90C51 BibTeX Cite \textit{M. S. Morshed}, ``Augmented Newton Method for Optimization: Global Linear Rate and Momentum Interpretation'', Preprint, arXiv:2205.11033 [math.OC] (2022) Full Text: arXiv OA License
Lackenby, Marc; Schleimer, Saul Recognising elliptic manifolds. arXiv:2205.08802 Preprint, arXiv:2205.08802 [math.GT] (2022). MSC: 57-08 57K30 57K35 57Q15 68Q25 BibTeX Cite \textit{M. Lackenby} and \textit{S. Schleimer}, ``Recognising elliptic manifolds'', Preprint, arXiv:2205.08802 [math.GT] (2022) Full Text: arXiv OA License
Olshanskii, Alexander; Shpilrain, Vladimir Linear average-case complexity of algorithmic problems in groups. arXiv:2205.05232 Preprint, arXiv:2205.05232 [math.GR] (2022). MSC: 20F10 68Q25 BibTeX Cite \textit{A. Olshanskii} and \textit{V. Shpilrain}, ``Linear average-case complexity of algorithmic problems in groups'', Preprint, arXiv:2205.05232 [math.GR] (2022) Full Text: arXiv OA License
Chen, Qingyun; Laekhanukit, Bundit; Liao, Chao; Zhang, Yuhao Survivable Network Design Revisited: Group-Connectivity. arXiv:2204.13648 Preprint, arXiv:2204.13648 [cs.DS] (2022). MSC: 68W25 68Q25 BibTeX Cite \textit{Q. Chen} et al., ``Survivable Network Design Revisited: Group-Connectivity'', Preprint, arXiv:2204.13648 [cs.DS] (2022) Full Text: arXiv OA License
Roulet, Vincent; Srinivasa, Siddhartha; Fazel, Maryam; Harchaoui, Zaid Complexity Bounds of Iterative Linear Quadratic Optimization Algorithms for Discrete Time Nonlinear Control. arXiv:2204.02322 Preprint, arXiv:2204.02322 [math.OC] (2022). MSC: 68Q25 49M37 BibTeX Cite \textit{V. Roulet} et al., ``Complexity Bounds of Iterative Linear Quadratic Optimization Algorithms for Discrete Time Nonlinear Control'', Preprint, arXiv:2204.02322 [math.OC] (2022) Full Text: arXiv OA License
Florea, Mihai I. Gradient Methods with Memory for Minimizing Composite Functions. arXiv:2203.07318 Preprint, arXiv:2203.07318 [math.OC] (2022). MSC: 68Q25 65Y20 65B99 90C25 BibTeX Cite \textit{M. I. Florea}, ``Gradient Methods with Memory for Minimizing Composite Functions'', Preprint, arXiv:2203.07318 [math.OC] (2022) Full Text: arXiv OA License