3 papers
math.OC2026
An efficient penalty decomposition algorithm for minimization over sparse symmetric sets
Ahmad Mousavi, Morteza Kimiaei, Saman Babaie-Kafaki +1
This paper proposes an improved quasi-Newton penalty decomposition algorithm for the minimization of continuously differentiable functions, possibly nonconvex, over sparse symmetri…
cs.LG2025
Machine Learning Algorithms for Improving Black Box Optimization Solvers
Morteza Kimiaei, Vyacheslav Kungurtsev
Black-box optimization (BBO) addresses problems where objectives are accessible only through costly queries without gradients or explicit structure. Classical derivative-free metho…
math.OC2025
Machine Learning Algorithms for Improving Exact Classical Solvers in Mixed Integer Continuous Optimization
Morteza Kimiaei, Vyacheslav Kungurtsev, Brian Olimba
Integer and mixed-integer nonlinear programming (INLP, MINLP) are central to logistics, energy, and scheduling, but remain computationally challenging. This survey examines how mac…