Остановите войну!
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 34 matches
- 1999
- Heinz H. Bauschke, Jonathan M. Borwein, Wu Li:
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization. Math. Program. 86(1): 135-160 (1999) - Arjan Berkelaar, Benjamin Jansen, Kees Roos, Tamás Terlaky:
Basis- and partition identification for quadratic programming and linear complementarity problems. Math. Program. 86(2): 261-282 (1999) - Walter Gómez Bofill:
Properties of an interior embedding for solving nonlinear optimization problems. Math. Program. 86(3): 649-659 (1999) - Sylvia C. Boyd, Robert Carr:
A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Math. Program. 86(3): 499-514 (1999) - Sebastián Ceria, João Soares:
Convex programming for disjunctive convex optimization. Math. Program. 86(3): 595-614 (1999) - Xin Chen, Ya-Xiang Yuan:
A note on quadratic forms. Math. Program. 86(1): 187-197 (1999) - Cécile Cordier, Hugues Marchand, Richard Laundy, Laurence A. Wolsey:
bc - opt : a branch-and-cut code for mixed integer programs. Math. Program. 86(2): 335-353 (1999) - Aris Daniilidis, Nicolas Hadjisavvas:
Coercivity conditions and variational inequalities. Math. Program. 86(2): 433-438 (1999) - Xiaotie Deng, Christos H. Papadimitriou:
Decision-making by hierarchies of discordant agents. Math. Program. 86(2): 417-431 (1999) - Jonathan Eckstein, Michael C. Ferris:
Smooth methods of multipliers for complementarity problems. Math. Program. 86(1): 65-90 (1999) - Michael C. Ferris, Christian Kanzow, Todd S. Munson:
Feasible descent algorithms for mixed complementarity problems. Math. Program. 86(3): 475-497 (1999) - Robert M. Freund, Jorge R. Vera:
Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Program. 86(2): 225-260 (1999) - Daniel Granot, Herbert Hamers, Stef Tijs:
On some balanced, totally balanced and submodular delivery games. Math. Program. 86(2): 355-366 (1999) - Oktay Günlük:
A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86(1): 17-39 (1999) - Bingsheng He:
Inexact implicit methods for monotone general variational inequalities. Math. Program. 86(1): 199-217 (1999) - Matthias Heinkenschloss, Michael Ulbrich, Stefan Ulbrich:
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86(3): 615-635 (1999) - Keisuke Hotta, Akiko Yoshise:
Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems. Math. Program. 86(1): 105-133 (1999) - Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg:
Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86(2): 283-312 (1999) - Robert L. M. J. van de Leensel, C. P. M. van Hoesel, Joris van de Klundert:
Lifting valid inequalities for the precedence constrained knapsack problem. Math. Program. 86(1): 161-185 (1999) - Adam B. Levy:
Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions. Math. Program. 86(2): 439-441 (1999) - László Lovász:
Hit-and-run mixes fast. Math. Program. 86(3): 443-461 (1999) - S. R. Mohan, S. K. Neogy, T. Parthasarathy, S. Sinha:
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure. Math. Program. 86(3): 637-648 (1999) - Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky:
On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86(3): 463-473 (1999) - Ji-Ming Peng, Masao Fukushima:
A hybrid Newton method for solving the variational inequality problem via the D-gap function. Math. Program. 86(2): 367-386 (1999) - Ji-Ming Peng, Zheng-Hua Lin:
A non-interior continuation method for generalized linear complementarity problems. Math. Program. 86(3): 533-563 (1999) - Geoffrey Pritchard, Golbon Zakeri:
Upper bounds for Gaussian stochastic programs. Math. Program. 86(1): 51-63 (1999) - Stephen M. Robinson:
Linear convergence of epsilon-subgradient descent methods for a class of convex functions. Math. Program. 86(1): 41-50 (1999) - Jan-J. Rückmann:
On existence and uniqueness of stationary points in semi-infinite optimization. Math. Program. 86(2): 387-415 (1999) - Robert A. Stubbs, Sanjay Mehrotra:
A branch-and-cut method for 0-1 mixed convex programming. Math. Program. 86(3): 515-532 (1999) - Levent Tunçel:
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86(1): 219-223 (1999)
skipping 4 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-05-24 16:15 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