Остановите войну!
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 59 matches
- 2001
- Edward J. Anderson, Michael C. Ferris:
A Direct Search Algorithm for Optimization with Noisy Function Evaluations. SIAM J. Optim. 11(3): 837-857 (2001) - Charles Audet, John E. Dennis Jr.:
Pattern Search Algorithms for Mixed Variable Programming. SIAM J. Optim. 11(3): 573-594 (2001) - Fabián Flores Bazán:
Existence Theorems for Generalized Noncoercive Equilibrium Problems: The Quasi-Convex Case. SIAM J. Optim. 11(3): 675-690 (2001) - Ileana Castillo, Earl R. Barnes:
Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming. SIAM J. Optim. 11(3): 781-795 (2001) - Qun Chen, Michael C. Ferris:
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver. SIAM J. Optim. 11(4): 1019-1036 (2001) - Ian D. Coope, Christopher John Price:
On the Convergence of Grid-Based Methods for Unconstrained Optimization. SIAM J. Optim. 11(4): 859-869 (2001) - Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata:
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. Optim. 11(3): 647-674 (2001) - Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. 11(4): 974-1002 (2001) - Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio:
Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM J. Optim. 11(4): 1081-1091 (2001) - Xianping Guo, Peng Shi:
Limiting Average Criteria For Nonstationary Markov Decision Processes. SIAM J. Optim. 11(4): 1037-1053 (2001) - Calvin A. Johnson, Ariela Sofer:
A Primal-Dual Method for Large-Scale Image Reconstruction in Emission Tomography. SIAM J. Optim. 11(3): 691-715 (2001) - Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky:
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM J. Optim. 11(4): 870-888 (2001) - Jean B. Lasserre:
Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. 11(3): 796-817 (2001) - Craig T. Lawrence, André L. Tits:
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. SIAM J. Optim. 11(4): 1092-1118 (2001) - Dong-Hui Li, Masao Fukushima:
On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. 11(4): 1054-1064 (2001) - Petra Mutzel:
An Alternative Method to Crossing Minimization on Hierarchical Graphs. SIAM J. Optim. 11(4): 1065-1080 (2001) - Manuel Núñez, Robert M. Freund:
Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program. SIAM J. Optim. 11(3): 818-836 (2001) - Elijah Polak, Liqun Qi, Defeng Sun:
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems. SIAM J. Optim. 11(4): 937-961 (2001) - Liqun Qi, Zengxin Wei:
Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods. SIAM J. Optim. 11(4): 1145-1146 (2001) - G. Ravindran, M. Seetharama Gowda:
Regularization of P[sub 0]-Functions in Box Variational Inequality Problems. SIAM J. Optim. 11(3): 748-760 (2001) - Simeon Reich, Alexander J. Zaslavski:
The Set of Divergent Descent Methods in a Banach Space is \boldmathSigma\unboldmath-Porous. SIAM J. Optim. 11(4): 1003-1018 (2001) - Marielba Rojas, Sandra A. Santos, Danny C. Sorensen:
A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem. SIAM J. Optim. 11(3): 611-646 (2001) - F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian:
Approximating the Single-Sink Link-Installation Problem in Network Design. SIAM J. Optim. 11(3): 595-610 (2001) - Roger W. H. Sargent, M. Ding:
A New SQP Algorithm for Large-Scale Nonlinear Programming. SIAM J. Optim. 11(3): 716-747 (2001) - Stefan Scholtes:
Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 11(4): 918-936 (2001) - Michael Ulbrich:
Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems. SIAM J. Optim. 11(4): 889-917 (2001) - Layne T. Watson:
Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming. SIAM J. Optim. 11(3): 761-780 (2001) - X. Q. Yang, X. X. Huang:
A Nonlinear Lagrangian Approach to Constrained Optimization Problems. SIAM J. Optim. 11(4): 1119-1144 (2001) - Yun-Bin Zhao, Duan Li:
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application. SIAM J. Optim. 11(4): 962-973 (2001) - 2000
- Erling D. Andersen:
On Primal and Dual Infeasibility Certificates in a Homogeneous Model for Convex Optimization. SIAM J. Optim. 11(2): 380-388 (2000)
skipping 29 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-29 18:08 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