Остановите войну!
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 15 matches
- 2011
- Aharon Ben-Tal, Sahely Bhadra, Chiranjib Bhattacharyya, J. Saketha Nath:
Chance constrained uncertain classification via robust optimization. Math. Program. 127(1): 145-173 (2011) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2): 245-295 (2011) - Marco Colombo, Jacek Gondzio, Andreas Grothey:
A warm-start approach for large-scale stochastic linear programs. Math. Program. 127(2): 371-397 (2011) - Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura:
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program. 127(2): 297-343 (2011) - Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye:
Statistical ranking and combinatorial Hodge theory. Math. Program. 127(1): 203-244 (2011) - Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions. Math. Program. 127(1): 89-122 (2011) - Anatoli B. Juditsky, Arkadi Nemirovski:
On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization. Math. Program. 127(1): 57-88 (2011) - Jochen Könemann, David Pritchard, Kunlun Tan:
A partition-based relaxation for Steiner trees. Math. Program. 127(2): 345-370 (2011) - Patrick D. Mackin, Asim Roy, Jyrki Wallenius:
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming. Math. Program. 127(2): 425-444 (2011) - Yurii E. Nesterov:
Barrier subgradient method. Math. Program. 127(1): 31-56 (2011) - Benjamin Recht, Weiyu Xu, Babak Hassibi:
Null space conditions and thresholds for rank minimization. Math. Program. 127(1): 175-202 (2011) - Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, Andrew Cotter:
Pegasos: primal estimated sub-gradient solver for SVM. Math. Program. 127(1): 3-30 (2011) - Paul Tseng, Immanuel M. Bomze, Werner Schachinger:
A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127(2): 399-424 (2011) - Alexandre d'Aspremont, Francis R. Bach, Inderjit S. Dhillon, Bin Yu:
Preface. Math. Program. 127(1): 1-2 (2011) - Alexandre d'Aspremont, Laurent El Ghaoui:
Testing the nullspace property using semidefinite programming. Math. Program. 127(1): 123-144 (2011)
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-05-06 17:25 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