default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIbrahim Kurban Özaslan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[j2]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
Accelerated forward-backward and Douglas-Rachford splitting dynamics. Autom. 175: 112210 (2025)- [c8]Ibrahim Kurban Özaslan, Wuwei Wu
, Jie Chen, Tryphon T. Georgiou, Mihailo R. Jovanovic:
Automated algorithm design for convex optimization problems with linear equality constraints. CDC 2025: 3977-3982 - [i6]Ibrahim Kurban Özaslan, Wuwei Wu, Jie Chen, Tryphon T. Georgiou, Mihailo R. Jovanovic:
Automated algorithm design for convex optimization problems with linear equality constraints. CoRR abs/2509.20746 (2025) - [i5]Ibrahim Kurban Özaslan, Tryphon T. Georgiou, Mihailo R. Jovanovic:
Automated Algorithm Design via Nevanlinna-Pick Interpolation. CoRR abs/2509.21416 (2025) - 2024
- [c7]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
From Exponential to Finite/Fixed-Time Stability: Applications to Optimization. CDC 2024: 5944-5949 - [i4]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
Accelerated forward-backward and Douglas-Rachford splitting dynamics. CoRR abs/2407.20620 (2024) - [i3]Ibrahim Kurban Özaslan, Panagiotis Patrinos, Mihailo R. Jovanovic:
Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems. CoRR abs/2408.15969 (2024) - [i2]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
From exponential to finite/fixed-time stability: Applications to optimization. CoRR abs/2409.11713 (2024) - 2023
- [j1]Ibrahim Kurban Özaslan, Hesameddin Mohammadi, Mihailo R. Jovanovic:
Computing Stabilizing Feedback Gains via a Model-Free Policy Gradient Method. IEEE Control. Syst. Lett. 7: 407-412 (2023) - [c6]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
On the global exponential stability of primal-dual dynamics for convex problems with linear equality constraints. ACC 2023: 210-215 - [c5]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
Tight Lower Bounds on the Convergence Rate of Primal-Dual Dynamics for Equality Constrained Convex Problems. CDC 2023: 7318-7323 - 2022
- [c4]Ibrahim Kurban Özaslan, Sepideh Hassan-Moghaddam, Mihailo R. Jovanovic:
On the asymptotic stability of proximal algorithms for convex optimization problems with multiple non-smooth regularizers. ACC 2022: 132-137 - [c3]Ibrahim Kurban Özaslan, Mihailo R. Jovanovic:
Exponential convergence of primal-dual dynamics for multi-block problems under local error bound condition. CDC 2022: 7579-7584
2010 – 2019
- 2019
- [c2]Ibrahim Kurban Özaslan, Mert Pilanci, Orhan Arikan:
Iterative Hessian Sketch with Momentum. ICASSP 2019: 7470-7474 - [c1]Ibrahim Kurban Özaslan, Mert Pilanci, Orhan Arikan:
Fast and Robust Solution Techniques for Large Scale Linear System of Equations. SIU 2019: 1-4 - [i1]Ibrahim Kurban Özaslan, Mert Pilanci, Orhan Arikan:
Regularized Momentum Iterative Hessian Sketch for Large Scale Linear System of Equations. CoRR abs/1912.03514 (2019)
Coauthor Index
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 2026-04-09 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
