Остановите войну!
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 33 matches
- 2016
- Andreas Fischer, Markus Herrich, Alexey F. Izmailov, Mikhail V. Solodov:
Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions. Comput. Optim. Appl. 63(2): 425-459 (2016) - Per Bergström:
Reliable updates of the transformation in the iterative closest point algorithm. Comput. Optim. Appl. 63(2): 543-557 (2016) - Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena:
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem. Comput. Optim. Appl. 63(3): 755-792 (2016) - Carmo P. Brás, Gabriele Eichfelder, Joaquim Júdice:
Copositivity tests based on the linear complementarity problem. Comput. Optim. Appl. 63(2): 461-493 (2016) - Coralia Cartis, Yiming Yan:
Active-set prediction for interior point methods using controlled perturbations. Comput. Optim. Appl. 63(3): 639-684 (2016) - László Csirmaz:
Using multiobjective optimization to map the entropy region. Comput. Optim. Appl. 63(1): 45-67 (2016) - Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena:
Lagrangian heuristics for the Quadratic Knapsack Problem. Comput. Optim. Appl. 63(1): 97-120 (2016) - Nicolas Delanoue, Mehdi Lhommeau, Philippe Lucidarme:
Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem. Comput. Optim. Appl. 63(3): 855-873 (2016) - Stephan Dempe, Susanne Franke:
On the solution of convex bilevel optimization problems. Comput. Optim. Appl. 63(3): 685-703 (2016) - Cédric Durantin, Julien Marzat, Mathieu Balesdent:
Analysis of multi-objective Kriging-based methods for constrained global optimization. Comput. Optim. Appl. 63(3): 903-926 (2016) - Antonio Frangioni, Fabio Furini, Claudio Gentile:
Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63(3): 705-735 (2016) - Clóvis C. Gonzaga, Ruana M. Schneider:
On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63(2): 523-542 (2016) - Helmut Harbrecht, Florian Loos:
Optimization of current carrying multicables. Comput. Optim. Appl. 63(1): 237-271 (2016) - Warren L. Hare, Claudia A. Sagastizábal, Mikhail V. Solodov:
A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63(1): 1-28 (2016) - Liusheng Hou, Hongjin He, Junfeng Yang:
A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA. Comput. Optim. Appl. 63(1): 273-303 (2016) - Wenma Jin, Yair Censor, Ming Jiang:
Bounded perturbation resilience of projected scaled gradient methods. Comput. Optim. Appl. 63(2): 365-392 (2016) - Yoshihiro Kanno:
Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach. Comput. Optim. Appl. 63(1): 203-236 (2016) - Jiao-Fen Li, Wen Li, Ru Huang:
An efficient method for solving a matrix least squares problem over a matrix inequality constraint. Comput. Optim. Appl. 63(2): 393-423 (2016) - Chen Ling, Hongjin He, Liqun Qi:
On the cone eigenvalue complementarity problem for higher-order tensors. Comput. Optim. Appl. 63(1): 143-168 (2016) - Jun Liu, Mingqing Xiao:
A leapfrog semi-smooth Newton-multigrid method for semilinear parabolic optimal control problems. Comput. Optim. Appl. 63(1): 69-95 (2016) - Williams Jesús López Yánez, Marcos Raydan:
An acceleration scheme for Dykstra's algorithm. Comput. Optim. Appl. 63(1): 29-44 (2016) - Mariano Mateos, Ira Neitzel:
Dirichlet control of elliptic state constrained problems. Comput. Optim. Appl. 63(3): 825-853 (2016) - Pedro Merino:
Finite element error estimates for an optimal control problem governed by the Burgers equation. Comput. Optim. Appl. 63(3): 793-824 (2016) - Xinhe Miao, Shengjuan Guo, Nuo Qi, Jein-Shan Chen:
Constructions of complementarity functions and merit functions for circular cone complementarity problem. Comput. Optim. Appl. 63(2): 495-522 (2016) - Ting Kei Pong, Hao Sun, Ningchuan Wang, Henry Wolkowicz:
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem. Comput. Optim. Appl. 63(2): 333-364 (2016) - Luigi Di Puglia Pugliese, Francesca Guerriero:
On the shortest path problem with negative cost cycles. Comput. Optim. Appl. 63(2): 559-583 (2016) - Oliver Schütze, Adanay Martín, Adriana Lara, Sergio Alvarado, Eduardo Salinas, Carlos A. Coello Coello:
The directed search method for multi-objective memetic algorithms. Comput. Optim. Appl. 63(2): 305-332 (2016) - Shaurya Sharma, Brage Rugstad Knudsen, Bjarne A. Grimstad:
Towards an objective feasibility pump for convex MINLPs. Comput. Optim. Appl. 63(3): 737-753 (2016) - Laurent Sorber, Ignat Domanov, Marc Van Barel, Lieven De Lathauwer:
Exact line and plane search for tensor optimization. Comput. Optim. Appl. 63(1): 121-142 (2016) - Andrea Walther, Lorenz T. Biegler:
On an inexact trust-region SQP-filter method for constrained nonlinear optimization. Comput. Optim. Appl. 63(3): 613-638 (2016)
skipping 3 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-03 09:16 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