Publications

Restarting two-term nonlinear conjugate gradient methods based on a finite precision arithmetic analysis. / Kimiaei, Morteza (Corresponding author); Babaie-Kafaki, Saman; Kungurtsev, Vyacheslav et al.
In: Journal of Computational and Applied Mathematics, Vol. 488, 117856, 15.12.2026.

Publications: Contribution to journal › Article › Peer Reviewed

Towards Real Time Control of Water Engineering with Nonlinear Hyperbolic Partial Differential Equations. / DiFonzo, Fabio; Holst, Michael; Kimiaei, Morteza et al.
In: Journal of Computational Science, 10.2026.

Publications: Contribution to journal › Article › Peer Reviewed

Enhanced Line Search Improves Robustness and Efficiency of Pose Sampling in Protein-Ligand Docking. / Gaskin, Leo ; Welsch, Matthias ; Kirchmair, Johannes et al.
In: Journal of Chemical Theory and Computation, 07.2026.

Publications: Contribution to journal › Article › Peer Reviewed

Fully Dynamic Spectral Sparsification for Directed Hypergraphs. / Forster, Sebastian; Goranci, Gramoz ; Momeni, Ali.
43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets. / Mousavi, Ahmad; Kimiaei, Morteza; Babaie-Kafaki, Saman et al.
2026.

Publications: Working paper › Preprint

Dynamic Hierarchical j-Tree Decomposition and Its Applications. / Goranci, Gramoz; Henzinger, Monika; Kiss, Peter et al.
ACM-SIAM Symposium on Discrete Algorithms (SODA26). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Tree Embedding in High Dimensions: Dynamic and Massively Parallel. / Goranci, Gramoz; Jiang, Shaofeng H.-C.; Kiss, Peter et al.
ACM-SIAM Symposium on Discrete Algorithms (SODA26). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

An improved randomized algorithm with noise level tuning for large-scale noisy unconstrained DFO problems. / Kimiaei, Morteza.
In: Numerical Algorithms, Vol. 110, 01.2026.

Publications: Contribution to journal › Article › Peer Reviewed

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints. / Bot, Radu Ioan; Nguyen, Dang Khoa; Zong, Chunxiang.
In: Journal of Scientific Computing, Vol. 105, No. 3, 73, 12.2025.

Publications: Contribution to journal › Article › Peer Reviewed

Fast convex optimization via closed-loop time scaling of gradient dynamics. / Attouch, Hedy; Bot, Radu Ioan; Nguyen, Dang Khoa.
In: ESAIM - Control, Optimisation and Calculus of Variations, Vol. 31, 89, 07.11.2025.

Publications: Contribution to journal › Article › Peer Reviewed

Fully Dynamic Algorithms for Chamfer Distance. / Goranci, Gramoz; Jiang, Shaofeng H.-C.; Kiss, Peter et al.
The 39th Annual Conference on Neural Information Processing Systems. 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Machine Learning Algorithms for Improving Black Box Optimization Solvers. / Kimiaei, Morteza; Kungurtsev, Vyacheslav.
2025.

Publications: Working paper › Preprint

Machine Learning Algorithms for Improving Exact Classical Solvers in Mixed Integer Continuous Optimization. / Kimiaei, Morteza; Kungurtsev, Vyacheslav; Olimba, Brian.
2025.

Publications: Working paper › Preprint

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. / Dong, Sally; Gao, Yu; Goranci, Gramoz et al.
In: Journal of the Association for Computing Machinery, Vol. 72, No. 4, 27, 26.07.2025.

Publications: Contribution to journal › Article › Peer Reviewed

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML 2025). / Goranci, Gramoz ; Kiss, Peter; Patel, Neel et al.
42nd International Conference on Machine Learning (ICML 2025). 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Fully Dynamic Algorithms for Transitive Reduction. / Goranci, Gramoz; Karczmarz, Adam; Momeni, Ali et al.
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025. ed. / Keren Censor-Hillel; Fabrizio Grandoni; Joel Ouaknine; Gabriele Puppis. 2025. 92.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Incremental Approximate Maximum Flow via Residual Graph Sparsification. / Goranci, Gramoz; Henzinger, Monika; Räcke, Harald et al.
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025. ed. / Keren Censor-Hillel; Fabrizio Grandoni; Joel Ouaknine; Gabriele Puppis. 2025. 91.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Fully Dynamic Algorithms for Transitive Reduction (HALG). / Goranci, Gramoz; Karczmarz, Adam; Momeni, Ali et al.
IGAFIT Highlights of Algorithms (HALG). 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. / Goranci, Gramoz ; Kiss, Peter; Patel, Neel et al.
IGAFIT Highlights of Algorithms 2025. 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization. / Kimiaei, Morteza; Neumaier, Arnold.
In: Mathematical Programming Computation, Vol. 17, 03.05.2025, p. 505 - 546.

Publications: Contribution to journal › Article › Peer Reviewed

Fast Optimistic Gradient Descent Ascent (OGDA) Method in Continuous and Discrete Time. / Boţ, Radu Ioan ; Csetnek, Ernö Robert; Nguyen, Dang Khoa.
In: Foundations of Computational Mathematics, Vol. 25, No. 1, 02.2025, p. 163-222.

Publications: Contribution to journal › Article › Peer Reviewed

A subspace inertial method for derivative-free nonlinear monotone equations. / Kimiaei, Morteza (Corresponding author); Hassan Ibrahim, Abdulkarim; Ghaderi, Susan.
In: Optimization: a journal of mathematical programming and operations research, Vol. 74, No. 2, 2025, p. 269-296.

Publications: Contribution to journal › Article › Peer Reviewed

Guaranteed bounds for optimal stopping problems using kernel-based non-asymptotic uniform confidence bands. / Pflug, Georg; Glanzer, Martin; Maier, Sebastian.
In: European Journal of Operational Research, Vol. 327, No. 1, 2025, p. 162-173.

Publications: Contribution to journal › Article › Peer Reviewed

Near-Optimal (1 + ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. / Filtser, Arnold; Goranci, Gramoz; Patel, Neel et al.
65th IEEE Symposium on Foundations of Computer Science (FOCS) 2024. 2024.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Worst case complexity bounds for linesearch-type derivative-free algorithms. / Brilli, Andrea; Kimiaei, Morteza; Liuzzi, Giampaolo et al.
In: Journal of Optimization Theory and Applications, Vol. 203, No. 1, 10.2024, p. 419-454.

Publications: Contribution to journal › Article › Peer Reviewed