4 papers · 1 filter
An Approximate Conjugate Subgradient Algorithm with Matrix Parameter for Derivative-Free Nonsmooth Optimization Problems
Morteza Kimiaei, Saman Babaie-Kafaki, Zohre Aminifard
We propose a derivative-free matrix conjugate-subgradient method for unconstrained nonsmooth optimization of locally Lipschitz functions. The method constructs discrete gradients u…
Reservoir Zero-Coordinatewise Projected Subspace Search for Minimization Over Sparse Symmetric Sets in Machine Learning
Morteza Kimiaei, Shima Shabani, Michael Breuss
We study a class of nonconvex cardinality-constrained optimization problems arising in sparse learning. These problems are NP-hard due to the combinatorial nature of sparsity const…
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…
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…