21 citations · 52 across the 12 of their papers we have counts for
12 papers
ALS: Augmented Lagrangian Sketching Methods for Linear Systems
Md Sarowar Morshed
We develop two fundamental stochastic sketching techniques; Penalty Sketching (PS) and Augmented Lagrangian Sketching (ALS) for solving consistent linear systems. The proposed PS a…
Augmented Newton Method for Optimization: Global Linear Rate and Momentum Interpretation
Md Sarowar Morshed
We propose two variants of Newton method for solving unconstrained minimization problem. Our method leverages optimization techniques such as penalty and augmented Lagrangian metho…
Penalty & Augmented Kaczmarz Methods For Linear Systems & Linear Feasibility Problems
Md Sarowar Morshed
In this work, we shed light on the so-called Kaczmarz method for solving Linear System (LS) and Linear Feasibility (LF) problems from a optimization point of view. We introduce wel…
Stochastic Steepest Descent Methods for Linear Systems: Greedy Sampling & Momentum
Md Sarowar Morshed, Sabbir Ahmad, Md Noor-E-Alam
Recently proposed adaptive Sketch & Project (SP) methods connect several well-known projection methods such as Randomized Kaczmarz (RK), Randomized Block Kaczmarz (RBK), Motzkin Re…
Sketch & Project Methods for Linear Feasibility Problems: Greedy Sampling & Momentum
Md Sarowar Morshed, Md. Noor-E-Alam
We develop two greedy sampling rules for the Sketch & Project method for solving linear feasibility problems. The proposed greedy sampling rules generalize the existing max-distanc…
A Computational Framework for Solving Nonlinear Binary OptimizationProblems in Robust Causal Inference
Md Saiful Islam, Md Sarowar Morshed, Md. Noor-E-Alam
Identifying cause-effect relations among variables is a key step in the decision-making process. While causal inference requires randomized experiments, researchers and policymaker…
Heavy Ball Momentum Induced Sampling Kaczmarz Motzkin Methods for Linear Feasibility Problems
Md Sarowar Morshed, Md. Noor-E-Alam
The recently proposed Sampling Kaczmarz Motzkin (SKM) algorithm performs well in comparison with the state-of-the-art methods in solving large-scale Linear Feasibility (LF) problem…
Logarithmic Integrals: A Review from Gradshteyn and Ryzhik to Recent Times
Md Sarowar Morshed
The need to evaluate Logarithmic integrals is ubiquitous in essentially all quantitative areas including mathematical sciences, physical sciences. Some recent developments in Physi…
Sampling Kaczmarz Motzkin Method for Linear Feasibility Problems: Generalization & Acceleration
Md Sarowar Morshed, Md Saiful Islam, Md. Noor-E-Alam
Randomized Kaczmarz (RK), Motzkin Method (MM) and Sampling Kaczmarz Motzkin (SKM) algorithms are commonly used iterative techniques for solving a system of linear inequalities (i.e…
Robust policy evaluation from large-scale observational studies
Md Saiful Islam, Md Sarowar Morshed, Gary J. Young +1
Under current policy decision making paradigm, we make or evaluate a policy decision by intervening different socio-economic parameters and analyzing the impact of those interventi…
Accelerated Sampling Kaczmarz Motzkin Algorithm for The Linear Feasibility Problem
Md Sarowar Morshed, Md Saiful Islam, Md. Noor-E-Alam
The Sampling Kaczmarz Motzkin (SKM) algorithm is a generalized method for solving large scale linear systems of inequalities. Having its root in the relaxation method of Agmon, Sch…
Generalized Affine Scaling Algorithms for Linear Programming Problems
Md Sarowar Morshed, Md. Noor-E-Alam
Interior Point Methods are widely used to solve Linear Programming problems. In this work, we present two primal affine scaling algorithms to achieve faster convergence in solving…