Остановите войну!
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 33 matches
- 2022
- Gennadiy Averkov, Matthias Schymura:
Complexity of linear relaxations in integer programming. Math. Program. 194(1): 191-227 (2022) - Gerald Beer, María J. Cánovas, Marco A. López, Juan Parra:
Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric. Math. Program. 194(1): 1185-1186 (2022) - Albert S. Berahas, Frank E. Curtis, Baoyu Zhou:
Limited-memory BFGS with displacement aggregation. Math. Program. 194(1): 121-157 (2022) - Mario Berta, Francesco Borderi, Omar Fawzi, Volkher B. Scholz:
Semidefinite programming hierarchies for constrained bilinear optimization. Math. Program. 194(1): 781-829 (2022) - M. Kanat Camlibel, Luigi Iannelli, Aneel Tanwani:
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators. Math. Program. 194(1): 1017-1059 (2022) - Lénaïc Chizat:
Sparse optimization on measures with over-parameterized gradient descent. Math. Program. 194(1): 487-532 (2022) - Joachim Dahl, Erling D. Andersen:
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization. Math. Program. 194(1): 341-370 (2022) - Radu-Alexandru Dragomir, Adrien B. Taylor, Alexandre d'Aspremont, Jérôme Bolte:
Optimal complexity and certification of Bregman first-order methods. Math. Program. 194(1): 41-83 (2022) - Oran Gannot:
A frequency-domain analysis of inexact gradient methods. Math. Program. 194(1): 975-1016 (2022) - Shaoyan Guo, Huifu Xu:
Robust spectral risk optimization when the subjective risk aversion is ambiguous: a moment-type approach. Math. Program. 194(1): 305-340 (2022) - Tobias Harks, Veerle Timmermans:
Equilibrium computation in resource allocation games. Math. Program. 194(1): 1-34 (2022) - Tobias Harks, Veerle Timmermans:
Correction to: Equilibrium computation in resource allocation games. Math. Program. 194(1): 35-40 (2022) - Wen Huang, Ke Wei:
Riemannian proximal gradient methods. Math. Program. 194(1): 371-413 (2022) - Yuni Iwamasa, Kenjiro Takazawa:
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194(1): 229-256 (2022) - Mehdi Karimi, Levent Tunçel:
Status determination by interior-point methods for convex optimization problems in domain-driven form. Math. Program. 194(1): 937-974 (2022) - Tamás Kis, Markó Horváth:
Ideal, non-extended formulations for disjunctive constraints admitting a network representation. Math. Program. 194(1): 831-869 (2022) - Victor I. Kolobov, Simeon Reich, Rafal Zalas:
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems. Math. Program. 194(1): 1163-1183 (2022) - David de Laat, Fabrício Caluza Machado, Fernando Mário de Oliveira Filho, Frank Vallentin:
k-Point semidefinite programming bounds for equiangular lines. Math. Program. 194(1): 533-567 (2022) - Guanghui Lan:
Correction to: Complexity of stochastic dual dynamic programming. Math. Program. 194(1): 1187-1189 (2022) - Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid bases with cardinality constraints on the intersection. Math. Program. 194(1): 661-684 (2022) - Haihao Lu:
An O(sr)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems. Math. Program. 194(1): 1061-1112 (2022) - Cheng Lu, Dorit S. Hochbaum:
A unified approach for a 1D generalized total variation problem. Math. Program. 194(1): 415-442 (2022) - Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. Math. Program. 194(1): 85-119 (2022) - Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194(1): 443-485 (2022) - Md Sarowar Morshed, Md. Saiful Islam, Md. Noor-E-Alam:
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration. Math. Program. 194(1): 719-779 (2022) - Alberto Del Pia, Mingchen Ma:
Proximity in concave integer quadratic programming. Math. Program. 194(1): 871-900 (2022) - Anton Rodomanov, Yurii E. Nesterov:
Rates of superlinear convergence for classical quasi-Newton methods. Math. Program. 194(1): 159-190 (2022) - Ernest K. Ryu, Robert Hannah, Wotao Yin:
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry. Math. Program. 194(1): 569-619 (2022) - Damian Straszak, Nisheeth K. Vishnoi:
Iteratively reweighted least squares and slime mold dynamics: connection and convergence. Math. Program. 194(1): 685-717 (2022) - Haoxiang Yang, David P. Morton:
Optimal crashing of an activity network with disruptions. Math. Program. 194(1): 1113-1162 (2022)
skipping 3 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-09-07 15:29 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