![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 37 matches
- 2024
- Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. Comput. Optim. Appl. 87(3): 835-891 (2024) - Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. Comput. Optim. Appl. 87(3): 893-934 (2024) - Roger Behling
, Yunier Bello-Cruz
, Alfredo N. Iusem
, Di Liu
, Luiz-Rafael Santos
:
A successive centralized circumcentered-reflection method for the convex feasibility problem. Comput. Optim. Appl. 87(1): 83-116 (2024) - Claire Boyer, Antoine Godichon-Baggioni
:
Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions. Comput. Optim. Appl. 87(2): 705-706 (2024) - Christian Clason:
Preface to special issue on "optimal control of nonlinear differential equations". Comput. Optim. Appl. 87(3): 707-710 (2024) - Shuotao Diao, Suvrajeet Sen
:
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data. Comput. Optim. Appl. 87(2): 355-395 (2024) - Elisabeth Diehl, Johannes Haubner, Michael Ulbrich
, Stefan Ulbrich
:
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension. Comput. Optim. Appl. 87(3): 711-751 (2024) - Elisabeth Diehl, Johannes Haubner, Michael Ulbrich, Stefan Ulbrich:
Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension. Comput. Optim. Appl. 87(3): 753-754 (2024) - Felipe Fidalgo
, Emerson V. Castelani, Guilherme Philippi:
A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems. Comput. Optim. Appl. 87(2): 501-530 (2024) - Robert M. Gower
, Dirk A. Lorenz
, Maximilian Winkler
:
A Bregman-Kaczmarz method for nonlinear systems of equations. Comput. Optim. Appl. 87(3): 1059-1098 (2024) - Annalisa Greco
, Francesco Cannizzaro, Riccardo Bruno, Alessandro Pluchino
:
A nested genetic algorithm strategy for an optimal seismic design of frames. Comput. Optim. Appl. 87(2): 677-704 (2024) - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
:
The continuous stochastic gradient method: part I-convergence theory. Comput. Optim. Appl. 87(3): 935-976 (2024) - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
:
The continuous stochastic gradient method: part II-application and numerics. Comput. Optim. Appl. 87(3): 977-1008 (2024) - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
:
Correction to: The continuous stochastic gradient method: part II-application and numerics. Comput. Optim. Appl. 87(3): 1009-1010 (2024) - Stuart M. Harwood
, Francisco Trespalacios, Dimitri J. Papageorgiou, Kevin C. Furman:
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming. Comput. Optim. Appl. 87(2): 641-676 (2024) - Fabian Hoppe
, Ira Neitzel:
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE. Comput. Optim. Appl. 87(3): 755-784 (2024) - Patrick R. Johnstone, Jonathan Eckstein
, Thomas Flynn, Shinjae Yoo:
Stochastic projective splitting. Comput. Optim. Appl. 87(2): 397-437 (2024) - Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo:
Correction to: Stochastic projective splitting. Comput. Optim. Appl. 87(2): 439 (2024) - Mikhail A. Karapetyants:
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. Comput. Optim. Appl. 87(2): 531-569 (2024) - Sudeep Kundu
, Karl Kunisch:
Policy iteration for Hamilton-Jacobi-Bellman equations with control constraints. Comput. Optim. Appl. 87(3): 785-809 (2024) - Can Li, Yannan Chen
, Dong-Hui Li:
Internet traffic tensor completion with tensor nuclear norm. Comput. Optim. Appl. 87(3): 1033-1057 (2024) - Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu, Yangyang Xu
:
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization. Comput. Optim. Appl. 87(1): 117-147 (2024) - Shiru Li, Tao Zhang, Yong Xia
:
A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares. Comput. Optim. Appl. 87(3): 1011-1031 (2024) - Marco Locatelli
:
A new technique to derive tight convex underestimators (sometimes envelopes). Comput. Optim. Appl. 87(2): 475-499 (2024) - A. Mohammadi
, Ana Luísa Custódio
:
A trust-region approach for computing Pareto fronts in multiobjective optimization. Comput. Optim. Appl. 87(1): 149-179 (2024) - Yassine Nabou, Ion Necoara
:
Efficiency of higher-order algorithms for minimizing composite functions. Comput. Optim. Appl. 87(2): 441-473 (2024) - Shahabeddin Najafi, Masoud Hajarian:
Multiobjective BFGS method for optimization on Riemannian manifolds. Comput. Optim. Appl. 87(2): 337-354 (2024) - Shummin Nakayama
, Yasushi Narushima, Hiroshi Yabe:
Inexact proximal DC Newton-type method for nonconvex composite functions. Comput. Optim. Appl. 87(2): 611-640 (2024) - Javier Peña
:
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems. Comput. Optim. Appl. 87(1): 323-335 (2024) - Bastian Pötzl
, Anton Schiela, Patrick Jaap
:
Inexact proximal Newton methods in Hilbert spaces. Comput. Optim. Appl. 87(1): 1-37 (2024)
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-08-27 01:56 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