![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Oleg Burdakov
Person information
- affiliation: Linköping University, Department of Mathematics, Sweden
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]Kai Hoppmann-Baum
, Oleg Burdakov
, Gioni Mexi
, Carl Johan Casselgren
, Thorsten Koch
:
Length-constrained cycle partition with an application to UAV routing. Optim. Methods Softw. 37(6): 2080-2116 (2022) - [j17]Johannes Brust
, Oleg Burdakov
, Jennifer B. Erway
, Roummel F. Marcia
:
Algorithm 1030: SC-SR1: MATLAB Software for Limited-memory SR1 Trust-region Methods. ACM Trans. Math. Softw. 48(4): 48:1-48:33 (2022) - 2021
- [j16]Antonia Arvanitaki
, Nikolaos Pappas, Niklas Carlsson, Parthajit Mohapatra, Oleg Burdakov:
Performance analysis of congestion-aware secure broadcast channels. EURASIP J. Wirel. Commun. Netw. 2021(1): 178 (2021) - 2020
- [j15]Oleg Burdakov:
Ioannis C. Demetriou and Panos M. Pardalos (eds): Approximation and Optimization: Algorithms, Complexity and Applications. Oper. Res. Forum 1(1) (2020) - [c4]Kai Hoppmann
, Gioni Mexi
, Oleg Burdakov
, Carl Johan Casselgren
, Thorsten Koch
:
Minimum Cycle Partition with Length Requirements. CPAIOR 2020: 273-282
2010 – 2019
- 2019
- [j14]Johannes Brust
, Oleg Burdakov, Jennifer B. Erway, Roummel F. Marcia:
A dense initialization for limited-memory quasi-Newton methods. Comput. Optim. Appl. 74(1): 121-142 (2019) - [j13]Oleg Sysoev
, Oleg Burdakov
:
A smoothed monotonic regression via L2 regularization. Knowl. Inf. Syst. 59(1): 197-218 (2019) - 2018
- [j12]Oleg Burdakov, Ahmad Kamandi
:
Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations. Appl. Math. Comput. 338: 421-431 (2018) - 2017
- [j11]Oleg Burdakov, Jonas Kvarnström, Patrick Doherty:
Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles. Ann. Oper. Res. 249(1-2): 163-174 (2017) - [j10]Oleg Burdakov, Oleg Sysoev
:
A Dual Active-Set Algorithm for Regularized Monotonic Regression. J. Optim. Theory Appl. 172(3): 929-949 (2017) - [j9]Oleg Burdakov, Lujin Gong, Spartak Zikrin
, Ya-Xiang Yuan:
On efficiently combining limited-memory and trust-region techniques. Math. Program. Comput. 9(1): 101-134 (2017) - 2016
- [j8]Oleg Sysoev
, Anders Grimvall, Oleg Burdakov:
Bootstrap Confidence Intervals for Large-scale Multivariate Monotonic Regression Problems. Commun. Stat. Simul. Comput. 45(3): 1025-1040 (2016) - [j7]Oleg P. Burdakov, Christian Kanzow, Alexandra Schwartz
:
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method. SIAM J. Optim. 26(1): 397-425 (2016) - 2014
- [p1]Oleg Burdakov, Patrick Doherty, Jonas Kvarnström:
Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance. Examining Robustness and Vulnerability of Networked Systems 2014: 26-50 - 2012
- [j6]Oleg Burdakov, Ivan Kapyrin, Yuri V. Vassilevski
:
Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions. J. Comput. Phys. 231(8): 3126-3142 (2012) - 2011
- [j5]Oleg Sysoev
, Oleg Burdakov, Anders Grimvall:
A segmentation-based algorithm for large-scale partially ordered monotonic regression. Comput. Stat. Data Anal. 55(8): 2463-2476 (2011) - 2010
- [j4]Oleg Burdakov, Patrick Doherty, Kaj Holmberg
, Jonas Kvarnström
, Per-Magnus Olsson:
Relay Positioning for Unmanned Aerial Vehicle Surveillance. Int. J. Robotics Res. 29(8): 1069-1087 (2010) - [j3]Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson:
Optimal placement of UV-based communications relay nodes. J. Glob. Optim. 48(4): 511-531 (2010) - [c3]Per-Magnus Olsson, Jonas Kvarnström
, Patrick Doherty, Oleg Burdakov, Kaj Holmberg:
Generating UAV communication networks for monitoring and surveillance. ICARCV 2010: 1070-1077
2000 – 2009
- 2009
- [c2]Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson:
Positioning unmanned aerial vehicles as communication relays for surveillance tasks. Robotics: Science and Systems 2009 - 2005
- [j2]Oleg P. Burdakov, Andreas Griewank
, Alexander V. Lotov:
Yury G. Evtushenko - a tribute. Optim. Methods Softw. 20(1): 1-7 (2005) - 2002
- [j1]Oleg P. Burdakov, José Mario Martínez
, Elvio A. Pilotta:
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization. Ann. Oper. Res. 117(1-4): 51-70 (2002)
1990 – 1999
- 1993
- [c1]Oleg Burdakov, Ursula Felgenhauer:
Stable multipoint secant methods with released requirements to points position. System Modelling and Optimization 1993: 225-236
Coauthor Index
![](https://dblp.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.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint