![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 43 matches
- 1995
- Farid Alizadeh:
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM J. Optim. 5(1): 13-51 (1995) - Kurt M. Anstreicher, Robert A. Bosch:
A New Infinity-Norm Path Following Algorithm for Linear Programming. SIAM J. Optim. 5(2): 236-246 (1995) - Lorenz T. Biegler
, Jorge Nocedal, Claudia Schmid:
A Reduced Hessian Method for Large-Scale Constrained Optimization. SIAM J. Optim. 5(2): 314-347 (1995) - John R. Birge
, Liqun Qi:
Subdifferential Convergence in Stochastic Programs. SIAM J. Optim. 5(2): 436-453 (1995) - J. Frédéric Bonnans, Geneviève Launay:
Sequential Quadratic Programming with Penalization of the Displacement. SIAM J. Optim. 5(4): 792-812 (1995) - Jonathan M. Borwein, W. Z. Huang:
A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann-Shannon Entropy. SIAM J. Optim. 5(1): 68-99 (1995) - E. Andrew Boyd:
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming. SIAM J. Optim. 5(2): 421-435 (1995) - Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang:
Ladders for Travelling Salesmen. SIAM J. Optim. 5(2): 408-420 (1995) - Mahmoud El-Alem
:
A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization. SIAM J. Optim. 5(2): 348-378 (1995) - Roger Fletcher:
An Optimal Positive Definite Update for Sparse Hessian Matrices. SIAM J. Optim. 5(1): 192-218 (1995) - Bennett L. Fox:
Faster Simulated Annealing. SIAM J. Optim. 5(3): 488-505 (1995) - Robert M. Freund:
A Potential Reduction Algorithm with User-Specified Phase I-Phase II Balance for Solving a Linear Program from an Infeasible Warm Start. SIAM J. Optim. 5(2): 247-268 (1995) - Paul C. Gilmore, Carl T. Kelley:
An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima. SIAM J. Optim. 5(2): 269-285 (1995) - Roland Glowinski, Anthony J. Kearsley:
On the Simulation and Control of Some Friction Constrained Motions. SIAM J. Optim. 5(3): 681-694 (1995) - Günther Gramlich, Rainer Hettich, Ekkehard W. Sachs:
Local Convergence of SQP Methods in Semi-Infinite Programming. SIAM J. Optim. 5(3): 641-658 (1995) - Lov K. Grover:
Fast Interior Point Methods for Bipartite Matching. SIAM J. Optim. 5(4): 740-769 (1995) - Bruce Hendrickson:
The Molecule Problem: Exploiting Structure in Global Optimization. SIAM J. Optim. 5(4): 835-857 (1995) - Florian Jarre, Michael A. Saunders:
A Practical Interior-Point Method for Convex Programming. SIAM J. Optim. 5(1): 149-171 (1995) - Y. Jiang, W. R. Smith, G. R. Chapman:
Global Optimality Conditions and their Geometric Interpretation for the Chemical and Phase Equilibrium Problem. SIAM J. Optim. 5(4): 813-834 (1995) - Dinh The Luc:
Taylor's Formula for Ck, 1 Functions. SIAM J. Optim. 5(3): 659-669 (1995) - Philippe Mahey, Said Oualibouch
, Pham Dinh Tao:
Proximal Decomposition on the Graph of a Maximal Monotone Operator. SIAM J. Optim. 5(2): 454-466 (1995) - Mike McKenna, Jill P. Mesirov, Stavros A. Zenios
:
Data Parallel Quadratic Programming on Box-Constrained Problems. SIAM J. Optim. 5(3): 570-589 (1995) - Shinji Mizuno, Masakazu Kojima, Michael J. Todd:
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming. SIAM J. Optim. 5(1): 52-67 (1995) - Renato D. C. Monteiro, Jong-Shi Pang, Tao Wang:
A Positive Algorithm for the Nonlinear Complementarity Problem. SIAM J. Optim. 5(1): 129-148 (1995) - Walter Murray, Francisco J. Prieto
:
A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem. SIAM J. Optim. 5(3): 590-640 (1995) - Dianne P. O'Leary:
Why Broyden's Nonsymmetric Method Terminates on Linear Equations. SIAM J. Optim. 5(2): 231-235 (1995) - Svatopluk Poljak, Franz Rendl:
Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. 5(3): 467-487 (1995) - M. J. D. Powell:
Some Convergence Properties of the Modified Log Barrier Method for Linear Programming. SIAM J. Optim. 5(4): 695-739 (1995) - Liqun Qi:
Trust Region Algorithms for Solving Nonsmooth Equations. SIAM J. Optim. 5(1): 219-230 (1995) - James Renegar:
Incorporating Condition Measures into the Complexity Theory of Linear Programming. SIAM J. Optim. 5(3): 506-524 (1995)
skipping 13 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-23 20:14 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