![](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 18 matches
- 2024
- Artem Agafonov, Dmitry Kamzolov, Pavel E. Dvurechensky, Alexander V. Gasnikov, Martin Takác:
Inexact tensor methods and their application to stochastic convex optimization. Optim. Methods Softw. 39(1): 42-83 (2024) - Lam Quoc Anh, Tran Ngoc Tam:
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results. Optim. Methods Softw. 39(2): 368-383 (2024) - Oumaima Benchettou, Abdeslem Hafid Bentbib, Abderrahman Bouhamidi:
Tensorial total variation-based image and video restoration with optimized projection methods. Optim. Methods Softw. 39(1): 102-133 (2024) - Giancarlo Bigi, Sonia Cafieri, Nicolas Couëllan, Sophie Jan, Frédéric Messine:
Foreword. Optim. Methods Softw. 39(1): 1-3 (2024) - Evgeny Bobrov, Dmitry Kropotov, Sergey Troshin, Danila Zaev:
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users. Optim. Methods Softw. 39(2): 282-297 (2024) - Xiao-Wen Chang, Tianchi Ma:
An ADMM based method for underdetermined box-constrained integer least squares problems. Optim. Methods Softw. 39(2): 321-344 (2024) - Qiao-Li Dong, Min Su, Yekini Shehu:
Three-operator reflected forward-backward splitting algorithm with double inertial effects. Optim. Methods Softw. 39(2): 431-456 (2024) - Manlio Gaudioso, Giovanni Giallombardo, Jean-Baptiste Hiriart-Urruty:
Dual formulation of the sparsity constrained optimization problem: application to classification. Optim. Methods Softw. 39(1): 84-101 (2024) - Yining Gu, Yanjun Wang:
Distributionally robust joint chance-constrained programming with Wasserstein metric. Optim. Methods Softw. 39(1): 134-168 (2024) - Chinedu Izuchukwu, Yekini Shehu:
A new inertial projected reflected gradient method with application to optimal control problems. Optim. Methods Softw. 39(1): 197-226 (2024) - Y. N. Jiang, X. J. Cai, D. R. Han, J. F. Yang:
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems. Optim. Methods Softw. 39(2): 257-281 (2024) - Cuixia Li, Shiliang Wu:
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem. Optim. Methods Softw. 39(2): 414-430 (2024) - Daniela Lupu, Ion Necoara:
Convergence analysis of stochastic higher-order majorization-minimization algorithms. Optim. Methods Softw. 39(2): 384-413 (2024) - Bardhyl Miftari, Mathias Berger, Guillaume Derval, Quentin Louveaux, Damien Ernst:
GBOML: a structure-exploiting optimization modelling language in Python. Optim. Methods Softw. 39(1): 227-256 (2024) - Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
IntSat: integer linear programming by conflict-driven constraint learning. Optim. Methods Softw. 39(1): 169-196 (2024) - Matteo Salani, Saverio Basso, Vincenzo Giuffrida:
PathWyse: a flexible, open-source library for the resource constrained shortest path problem. Optim. Methods Softw. 39(2): 298-320 (2024) - Gwenaël Samain, Sébastien Bourguignon, Jordan Ninin:
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization. Optim. Methods Softw. 39(1): 4-41 (2024) - Gulcin Dinc Yalcin, Frank E. Curtis:
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem. Optim. Methods Softw. 39(2): 345-367 (2024)
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-14 20:47 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