6 citations · 12 across the 8 of their papers we have counts for
8 papers · 1 filter
A First-Order Numerical Algorithm without Matrix Operations
Muhammad Adil, Ramtin Madani, Sasan Tavakkol +1
This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally cha…
Rapid Convergence of First-Order Numerical Algorithms via Adaptive Conditioning
Muhammad Adil, Sasan Tavakkol, Ramtin Madani
This paper is an attempt to remedy the problem of slow convergence for first-order numerical algorithms by proposing an adaptive conditioning heuristic. First, we propose a paralle…
Penalized Semidefinite Programming for Quadratically-Constrained Quadratic Optimization
Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei +1
In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs). We incorporate penalty terms into the…
Convex Relaxation of Bilinear Matrix Inequalities Part II: Applications to Optimal Control Synthesis
Mohsen Kheirandishfard, Fariba Zohrizadeh, Muhammad Adil +1
The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we…
Convex Relaxation of Bilinear Matrix Inequalities Part I: Theoretical Results
Mohsen Kheirandishfard, Fariba Zohrizadeh, Ramtin Madani
This two-part paper is concerned with the problem of minimizing a linear objective function subject to a bilinear matrix inequality (BMI) constraint. In this part, we first conside…
Sequential Relaxation of Unit Commitment with AC Transmission Constraints
Fariba Zohrizadeh, Mohsen Kheirandishfard, Adnan Nasir +1
This paper proposes a sequential convex relaxation method for obtaining feasible and near-globally optimal solutions for unit commitment (UC) with AC transmission constraints. Firs…