Остановите войну!
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
- 2020
- Hesam Ahmadi, Uday V. Shanbhag:
On the resolution of misspecified convex optimization and monotone variational inequality problems. Comput. Optim. Appl. 77(1): 125-161 (2020) - Siamak Akbarzadeh, Jan Hückelheim, Jens-Dominik Müller:
Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation. Comput. Optim. Appl. 77(2): 597-616 (2020) - Gilles Bareilles, Franck Iutzeler:
On the interplay between acceleration and identification for the proximal gradient algorithm. Comput. Optim. Appl. 77(2): 351-378 (2020) - Alberto Bemporad:
Global optimization via inverse distance weighting and radial basis functions. Comput. Optim. Appl. 77(2): 571-595 (2020) - Abdesslem Boulkhemair, Abdelkrim Chakib, Abdeljalil Nachaoui, Agaddin A. Niftiyev, Azeddine Sadik:
On a numerical shape optimization approach for a class of free boundary problems. Comput. Optim. Appl. 77(2): 509-537 (2020) - Carmo P. Brás, Ana Luísa Custódio:
On the use of polynomial models in multiobjective directional direct search. Comput. Optim. Appl. 77(3): 897-918 (2020) - Andrea Caliciotti, Giovanni Fasano, Florian A. Potra, Massimo Roma:
Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton's equation. Comput. Optim. Appl. 77(3): 627-651 (2020) - Yunmei Chen, Xiaojing Ye, Wei Zhang:
Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization. Comput. Optim. Appl. 77(2): 411-432 (2020) - Stefano Cipolla, Carmine Di Fiore, Paolo Zellini:
A variation of Broyden class methods using Householder adaptive transforms. Comput. Optim. Appl. 77(2): 433-463 (2020) - Guido Cocchi, Matteo Lapucci:
An augmented Lagrangian algorithm for multi-objective optimization. Comput. Optim. Appl. 77(1): 29-56 (2020) - Guido Cocchi, Giampaolo Liuzzi, Stefano Lucidi, Marco Sciandrone:
On the convergence of steepest descent methods for multiobjective optimization. Comput. Optim. Appl. 77(1): 1-27 (2020) - Andrea Cristofari, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
An active-set algorithmic framework for non-convex optimization problems over the simplex. Comput. Optim. Appl. 77(1): 57-89 (2020) - Nicolas Delanoue, Mehdi Lhommeau, Sebastien Lagrange:
Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis. Comput. Optim. Appl. 77(1): 307-334 (2020) - Masao Fukushima, Joaquim Júdice, Welington de Oliveira, Valentina Sessa:
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem. Comput. Optim. Appl. 77(3): 711-728 (2020) - William W. Hager, Hongchao Zhang:
Convergence rates for an inexact ADMM applied to separable convex optimization. Comput. Optim. Appl. 77(3): 729-754 (2020) - Juncai He, Xiaodong Jia, Jinchao Xu, Lian Zhang, Liang Zhao:
Make ℓ 1 regularization effective in training sparse CNN. Comput. Optim. Appl. 77(1): 163-182 (2020) - Yaohua Hu, Jiawen Li, Carisa Kwok Wai Yu:
Convergence rates of subgradient methods for quasi-convex optimization problems. Comput. Optim. Appl. 77(1): 183-212 (2020) - Nicolas Kämmerling, Jannis Kurtz:
Oracle-based algorithms for binary two-stage robust optimization. Comput. Optim. Appl. 77(2): 539-569 (2020) - Veronika Karl, Ira Neitzel, Daniel Wachsmuth:
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems. Comput. Optim. Appl. 77(3): 831-869 (2020) - Lorenzo Lampariello, Christoph Neumann, Jacopo M. Ricci, Simone Sagratella, Oliver Stein:
An explicit Tikhonov algorithm for nested variational inequalities. Comput. Optim. Appl. 77(2): 335-350 (2020) - Hongwei Liu, Jun Yang:
Weak convergence of iterative methods for solving quasimonotone variational inequalities. Comput. Optim. Appl. 77(2): 491-508 (2020) - Nicolas Loizou, Peter Richtárik:
Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. Comput. Optim. Appl. 77(3): 653-710 (2020) - Morteza Maleknia, Mostafa Shamsi:
A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions. Comput. Optim. Appl. 77(2): 379-409 (2020) - Massimo De Mauri, Joris Gillis, Jan Swevers, Goele Pipeleers:
A proximal-point outer approximation algorithm. Comput. Optim. Appl. 77(3): 755-777 (2020) - Zhenyu Ming, Liping Zhang, Liqun Qi:
Expected residual minimization method for monotone stochastic tensor complementarity problem. Comput. Optim. Appl. 77(3): 871-896 (2020) - Konstantin Pieper, Bao Quoc Tang, Philip Trautmann, Daniel Walter:
Inverse point source location with the Helmholtz equation on a bounded domain. Comput. Optim. Appl. 77(1): 213-249 (2020) - Julius Fergy T. Rabago, Hideyuki Azegami:
A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional. Comput. Optim. Appl. 77(1): 251-305 (2020) - Hiroyuki Sakai, Hideaki Iiduka:
Hybrid Riemannian conjugate gradient methods with global convergence properties. Comput. Optim. Appl. 77(3): 811-830 (2020) - Min Tao:
Convergence study of indefinite proximal ADMM with a relaxation factor. Comput. Optim. Appl. 77(1): 91-123 (2020) - Xiangfeng Wang, Junping Zhang, Wenxing Zhang:
The distance between convex sets with Minkowski sum structure: application to collision detection. Comput. Optim. Appl. 77(2): 465-490 (2020)
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-08-05 20:27 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