Остановите войну!
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 28 matches
- 1996
- Kurt M. Anstreicher:
Volumetric path following algorithms for linear programming. Math. Program. 76: 245-263 (1996) - Stephen C. Billups, Michael C. Ferris:
QPCOMP: A quadratic programming based solver for mixed complementarity problems. Math. Program. 76: 533-562 (1996) - Yuri M. Ermoliev, Arkadii V. Kryazhimskii, Andrzej Ruszczynski:
Constraint aggregation principle in convex optimization. Math. Program. 76: 353-372 (1996) - Francisco Facchinei, Christian Kanzow:
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Program. 76: 493-512 (1996) - Andreas Fischer:
Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Program. 76: 513-532 (1996) - Roland W. Freund, Florian Jarre:
A QMR-based interior-point algorithm for solving linear programs. Math. Program. 76: 183-210 (1996) - Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial:
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76: 131-154 (1996) - Clóvis C. Gonzaga:
The largest step path following algorithm for monotone linear complementarity problems. Math. Program. 76: 309-332 (1996) - Clóvis C. Gonzaga, J. Frédéric Bonnans:
Fast convergence of the simplified largest step path following algorithm. Math. Program. 76: 95-115 (1996) - Satoru Iwata:
A capacity scaling algorithm for convex cost submodular flows. Math. Program. 76: 299-308 (1996) - Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76: 117-130 (1996) - Wilfred Kaplan, Wei H. Yang:
Duality theorem for a generalized Fermat-Weber problem. Math. Program. 76: 285-297 (1996) - Kyriakos Kilakos, Odile Marotte:
Fractional and integral colourings. Math. Program. 76: 333-347 (1996) - Kenneth O. Kortanek, Xiaojie Xu, Yinyu Ye:
An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Program. 76: 155-181 (1996) - Bernd Kummer:
Parametrizations of Kojima's system and relations to penalty and barrier functions. Math. Program. 76: 579-592 (1996) - Claude Lemaréchal, Claudia A. Sagastizábal:
Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76: 393-410 (1996) - José Mario Martínez, Antônio Carlos Moretti:
A trust region method for minimization of nonsmooth functions with linear constraints. Math. Program. 76: 431-449 (1996) - Yurii E. Nesterov:
Long-step strategies in interior-point primal-dual methods. Math. Program. 76: 47-94 (1996) - Evgeni A. Nurminski:
Separating plane algorithms for convex optimization. Math. Program. 76: 373-391 (1996) - Roman A. Polyak, Marc Teboulle:
Nonlinear rescaling and proximal-like methods in convex optimization. Math. Program. 76: 265-284 (1996) - Florian A. Potra, Rongqin Sheng:
Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points. Math. Program. 76: 223-244 (1996) - Liqun Qi, Xiaojun Chen:
A preconditioning proximal Newton method for nondifferentiable convex optimization. Math. Program. 76: 411-429 (1996) - Daniel Ralph, Stefan Scholtes:
Sensitivity analysis of composite piecewise smooth equations. Math. Program. 76: 593-612 (1996) - Hichem Sellami, Stephen M. Robinson:
Implementation of a continuation method for normal maps. Math. Program. 76: 563-578 (1996) - Jie Sun:
On piecewise quadratic Newton and trust region problems. Math. Program. 76: 451-467 (1996) - Michael J. Todd:
Potential-reduction methods in mathematical programming. Math. Program. 76: 3-45 (1996) - Nobuo Yamashita, Masao Fukushima:
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Math. Program. 76: 469-491 (1996) - Yinyu Ye:
On homogeneous and self-dual algorithms for LCP. Math. Program. 76: 211-221 (1996)
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-03 04:54 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