![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 61 matches
- 1996
- Knud D. Andersen:
An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms. SIAM J. Optim. 6(1): 74-95 (1996) - Sigrún Andradóttir:
A Global Search Method for Discrete Stochastic Optimization. SIAM J. Optim. 6(2): 513-530 (1996) - Kurt M. Anstreicher:
On Long Step Path Following and SUMT for Linear and Quadratic Programming. SIAM J. Optim. 6(1): 33-46 (1996) - Hédy Attouch:
Viscosity Solutions of Minimization Problems. SIAM J. Optim. 6(3): 769-806 (1996) - Francisco Barahona:
Network Design Using Cut Inequalities. SIAM J. Optim. 6(3): 823-837 (1996) - Aharon Ben-Tal, Marc Teboulle:
A Conjugate Duality Scheme Generating a New Class of Differentiable Duals. SIAM J. Optim. 6(3): 617-625 (1996) - Dimitri P. Bertsekas:
Incremental Least Squares Methods and the Extended Kalman Filter. SIAM J. Optim. 6(3): 807-822 (1996) - Stephen C. Billups
, Michael C. Ferris
:
Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points. SIAM J. Optim. 6(2): 316-325 (1996) - Endre Boros
, Frank K. Hwang:
Optimality of Nested Partitions and Its Application to Cluster Analysis. SIAM J. Optim. 6(4): 1153-1162 (1996) - James V. Burke, Paul Tseng:
A Unified Analysis of Hoffman's Bound via Fenchel Duality. SIAM J. Optim. 6(2): 265-282 (1996) - Richard H. Byrd, Humaid Khalfan, Robert B. Schnabel:
Analysis of a Symmetric Rank-One Trust Region Method. SIAM J. Optim. 6(4): 1025-1039 (1996) - Thomas F. Coleman, Yuying Li:
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds. SIAM J. Optim. 6(2): 418-445 (1996) - Thomas F. Coleman, Yuying Li:
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables. SIAM J. Optim. 6(4): 1040-1058 (1996) - Andrew R. Conn, Nicholas I. M. Gould
, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. 6(3): 674-703 (1996) - Andrew R. Conn, Nick I. M. Gould
, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. SIAM J. Optim. 6(4): 1059-1086 (1996) - Simon Di:
Classical Optimality Conditions under Weaker Assumptions. SIAM J. Optim. 6(1): 178-197 (1996) - Asen L. Dontchev
, R. Tyrrell Rockafellar
:
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets. SIAM J. Optim. 6(4): 1087-1105 (1996) - Robert Entriken:
Parallel Decomposition: Results for Staircase Linear Programs. SIAM J. Optim. 6(4): 961-977 (1996) - Leonid Faybusovich:
Semidefinite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional. SIAM J. Optim. 6(4): 1007-1024 (1996) - Dan Feng, Robert B. Schnabel:
Tensor Methods for Equality Constrained Optimization. SIAM J. Optim. 6(3): 653-673 (1996) - Carlos E. Ferreira, Alexander Martin
, Robert Weismantel:
Solving Multiple Knapsack Problems by Cutting Planes. SIAM J. Optim. 6(3): 858-877 (1996) - Masao Fukushima, Liqun Qi:
A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization. SIAM J. Optim. 6(4): 1106-1120 (1996) - Bevil Milton Glover, Y. Ishizuka, Vaithilingam Jeyakumar
, H. D. Tuan:
Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions. SIAM J. Optim. 6(2): 362-372 (1996) - Jean-Louis Goffin, Zhi-Quan Luo, Yinyu Ye:
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems. SIAM J. Optim. 6(3): 638-652 (1996) - Michael D. Grigoriadis, Leonid G. Khachiyan:
An Interior Point Method for Bordered Block-Diagonal Linear Programs. SIAM J. Optim. 6(4): 913-932 (1996) - Wolfgang M. Hartmann, Robert E. Hartwig:
Computing the Moore-Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation. SIAM J. Optim. 6(3): 727-747 (1996) - Matthias Heinkenschloss
:
Projected Sequential Quadratic Programming Methods. SIAM J. Optim. 6(2): 373-417 (1996) - Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz:
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6(2): 342-361 (1996) - Dorit S. Hochbaum, Sung-Pil Hong:
On the Complexity of the Production-Transportation Problem. SIAM J. Optim. 6(1): 250-264 (1996) - Pi-Fang Hung, Yinyu Ye:
An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods. SIAM J. Optim. 6(3): 570-586 (1996)
skipping 31 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-25 08:50 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