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 21 matches
- 2024
- Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi, Dániel Varga, Pál Zsámboki:
The density of planar sets avoiding unit distances. Math. Program. 207(1): 303-327 (2024) - Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. Math. Program. 207(1): 329-367 (2024) - Daniel Brosch, Sven C. Polak:
New lower bounds on crossing numbers of Km,n from semidefinite programming. Math. Program. 207(1): 693-715 (2024) - Liyuan Cao, Albert S. Berahas, Katya Scheinberg:
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles. Math. Program. 207(1): 55-106 (2024) - Federica Cecchetto, Vera Traub, Rico Zenklusen:
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207(1): 515-549 (2024) - Damek Davis, Dmitriy Drusvyatskiy, Vasileios Charisopoulos:
Stochastic algorithms with geometric step decay converge linearly on sharp functions. Math. Program. 207(1): 145-190 (2024) - Alex Dunbar, Saumya Sinha, Andrew J. Schaefer:
Relaxations and duality for multiobjective integer programming. Math. Program. 207(1): 577-616 (2024) - Jean-Pierre Dussault, Tangi Migot, Dominique Orban:
Scalable adaptive cubic regularization methods. Math. Program. 207(1): 191-225 (2024) - Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. 207(1): 717-732 (2024) - Cédric Josz, Lexiao Lai:
Global stability of first-order methods for coercive tame functions. Math. Program. 207(1): 551-576 (2024) - Rohit Kannan, Güzin Bayraksan, James R. Luedtke:
Residuals-based distributionally robust optimization with covariate information. Math. Program. 207(1): 369-425 (2024) - Igor Klep, Victor Magron, Jurij Volcic, Jie Wang:
State polynomials: positivity, optimization and nonlinear Bell inequalities. Math. Program. 207(1): 645-691 (2024) - Yan Li, Guanghui Lan, Tuo Zhao:
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity. Math. Program. 207(1): 457-513 (2024) - Alberto Del Pia, Aida Khajavirad:
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs. Math. Program. 207(1): 269-301 (2024) - Yong Sheng Soh, Antonios Varvitsiotis:
Multiplicative updates for symmetric-cone factorizations. Math. Program. 207(1): 427-456 (2024) - Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Optimal gradient tracking for decentralized optimization. Math. Program. 207(1): 1-53 (2024) - Yue Xie, Stephen J. Wright:
Complexity of a projected Newton-CG method for optimization with bounds. Math. Program. 207(1): 107-144 (2024) - Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev:
Efficient Kirszbraun extension with applications to regression. Math. Program. 207(1): 617-642 (2024) - Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev:
Correction: Efficient Kirszbraun extension with applications to regression. Math. Program. 207(1): 643 (2024) - Haixiang Zhang, Baturalp Yalcin, Javad Lavaei, Somayeh Sojoudi:
A new complexity metric for nonconvex rank-one generalized matrix completion. Math. Program. 207(1): 227-268 (2024) - Manru Zong, Yin Tat Lee, Man-Chung Yue:
Short-step methods are not strongly polynomial-time. Math. Program. 207(1): 733-746 (2024)
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-11-07 19:18 CET 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