activity
20192021
most citedAccelerated Sampling Kaczmarz Motzkin Algorithm for The Linear Feasibility Problem

21 citations · 39 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2021

A Two-Stage Feature Selection Approach for Robust Evaluation of Treatment Effects in High-Dimensional Observational Data

Md Saiful Islam, Sahil Shikalgar, Md. Noor-E-Alam

A Randomized Control Trial (RCT) is considered as the gold standard for evaluating the effect of any intervention or treatment. However, its feasibility is often hindered by ethica…

math.OC2020

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…

math.OC2020★ 1 cited

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…

stat.ME2019★ 17 cited

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…

math.OC2019★ 21 cited

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…