Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 120 matches
- 2024
- Yongmei Cai, Qian Guo, Xuerong Mao:
Strong convergence of an explicit numerical approximation for n-dimensional superlinear SDEs with positive solutions. Math. Comput. Simul. 216: 198-212 (2024) - Zhuanghua Liu, Luo Luo, Bryan Kian Hsiang Low:
Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates. AAAI 2024: 14097-14105 - Zhuanghua Liu, Luo Luo, Bryan Kian Hsiang Low:
Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates. CoRR abs/2402.02359 (2024) - 2023
- Zhen-Yuan Ji, Yu-Hong Dai:
Greedy PSB methods with explicit superlinear convergence. Comput. Optim. Appl. 85(3): 753-786 (2023) - Leo G. Rebholz, Mengying Xiao:
The Effect of Anderson Acceleration on Superlinear and Sublinear Convergence. J. Sci. Comput. 96(2): 34 (2023) - Qiujiang Jin, Aryan Mokhtari:
Non-asymptotic superlinear convergence of standard quasi-Newton methods. Math. Program. 200(1): 425-473 (2023) - Sen Na, Michal Derezinski, Michael W. Mahoney:
Hessian averaging in stochastic Newton methods achieves superlinear convergence. Math. Program. 201(1): 473-520 (2023) - Haishan Ye, Dachao Lin, Xiangyu Chang, Zhihua Zhang:
Towards explicit superlinear convergence rate for SR1. Math. Program. 199(1): 1273-1303 (2023) - Owe Axelsson, János Karátson, Frédéric Magoulès:
Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners. SIAM J. Numer. Anal. 61(2): 1057-1079 (2023) - Ruichen Jiang, Qiujiang Jin, Aryan Mokhtari:
Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence. COLT 2023: 1962-1992 - Ruichen Jiang, Qiujiang Jin, Aryan Mokhtari:
Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence. CoRR abs/2302.08580 (2023) - Bas Symoens, Wim Vanroose:
Residual QPAS subspace (ResQPASS) algorithm for bounded-variable least squares (BVLS) with superlinear Krylov convergence. CoRR abs/2302.13616 (2023) - Zhan Gao, Aryan Mokhtari, Alec Koppel:
Limited-Memory Greedy Quasi-Newton Method with Non-asymptotic Superlinear Convergence Rate. CoRR abs/2306.15444 (2023) - Niko Schmidt:
Global q-superlinear convergence of the infinite-dimensional Newton's method for the regularized p-Stokes equations. CoRR abs/2307.02930 (2023) - 2022
- Jiaqi Zhang, Keyou You, Tamer Basar:
Distributed adaptive Newton methods with global superlinear convergence. Autom. 138: 110156 (2022) - Julie Nutini, Issam H. Laradji, Mark Schmidt:
Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence. J. Mach. Learn. Res. 23: 131:1-131:74 (2022) - Anton Rodomanov, Yurii E. Nesterov:
Rates of superlinear convergence for classical quasi-Newton methods. Math. Program. 194(1): 159-190 (2022) - Yubo Du, Keyou You:
Adaptive Greedy Quasi-Newton with Superlinear Rate and Global Convergence Guarantee. CDC 2022: 7606-7611 - Qiujiang Jin, Alec Koppel, Ketan Rajawat, Aryan Mokhtari:
Sharpened Quasi-Newton Methods: Faster Superlinear Rate and Larger Local Convergence Neighborhood. ICML 2022: 10228-10250 - Amit Parag, Sébastien Kleff, Léo Saci, Nicolas Mansard, Olivier Stasse:
Value learning from trajectory optimization and Sobolev descent: A step toward reinforcement learning with superlinear convergence properties. ICRA 2022: 1-7 - Liangzu Peng, Christian Kümmerle, René Vidal:
Global Linear and Local Superlinear Convergence of IRLS for Non-Smooth Robust Regression. NeurIPS 2022 - Mengying Xiao:
Superlinear convergence of Anderson accelerated Newton's method for solving stationary Navier-Stokes equations. CoRR abs/2202.06700 (2022) - Sen Na, Michal Derezinski, Michael W. Mahoney:
Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence. CoRR abs/2204.09266 (2022) - Huimin Hu, Siqing Gan:
Strong convergence of the tamed Euler scheme for scalar SDEs with superlinearly growing and discontinuous drift coefficient. CoRR abs/2206.00088 (2022) - 2021
- Kazufumi Ito, Christoph Reisinger, Yufei Zhang:
A Neural Network-Based Policy Iteration Algorithm with Global H2-Superlinear Convergence for Stochastic Games on Domains. Found. Comput. Math. 21(2): 331-374 (2021) - S. H. Lui, Sarah Nataj:
Superlinear convergence of Broyden's method and BFGS algorithm using Kantorovich-type assumptions. J. Comput. Appl. Math. 385: 113204 (2021) - Anton Rodomanov, Yurii E. Nesterov:
New Results on Superlinear Convergence of Classical Quasi-Newton Methods. J. Optim. Theory Appl. 188(3): 744-769 (2021) - Masoud Ahookhosh, Andreas Themelis, Panagiotis Patrinos:
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima. SIAM J. Optim. 31(1): 653-685 (2021) - Anton Rodomanov, Yurii E. Nesterov:
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence. SIAM J. Optim. 31(1): 785-811 (2021) - Dachao Lin, Haishan Ye, Zhihua Zhang:
Greedy and Random Quasi-Newton Methods with Faster Explicit Superlinear Convergence. NeurIPS 2021: 6646-6657
skipping 90 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 08:32 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint