Polynomial interior-point algorithm for P*(κ) horizontal linear complementarity problems. - Soodabeh Asadi; Hossein Mansouri (Numer. Algorithms, 2013)

A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P*(κ)-horizontal Linear Complementarity Problems. - Soodabeh Asadi; Hossein Mansouri (Comput. Sci. J. Moldova, 2014)

On the P*(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones. - Soodabeh Asadi; Hossein Mansouri; Zsolt Darvay; Maryam Zangiabadi (Optim. Methods Softw., 2016)

An interior-point algorithm for horizontal linear complementarity problems. - Soodabeh Asadi; Hossein Mansouri; Maryam Zangiabadi (Int. J. Math. Oper. Res., 2018)

Large-Neighborhood Infeasible Predictor-Corrector Algorithm for Horizontal Linear Complementarity Problems over Cartesian Product of Symmetric Cones. - Soodabeh Asadi; Hossein Mansouri; Zsolt Darvay; Maryam Zangiabadi; Nezam Mahdavi-Amiri (J. Optim. Theory Appl., 2019)

A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization. - Soodabeh Asadi; Hossein Mansouri; Zsolt Darvay; Goran Lesaja; Maryam Zangiabadi (Optim. Methods Softw., 2019)

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization. - Soodabeh Asadi; Janez Povh (CoRR, 2020)

A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. - Soodabeh Asadi; Zsolt Darvay; Goran Lesaja; Nezam Mahdavi-Amiri; Florian A. Potra (J. Optim. Theory Appl., 2020)

Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. - Soodabeh Asadi; N. Mahdavi-Amiri; Zsolt Darvay; Petra Renáta Rigó (Optim. Methods Softw., 2022)

Robust piecewise linear L1-regression via nonsmooth DC optimization. - Adil M. Bagirov; Sona Taheri; Napsu Karmitsa; Nargiz Sultanova; Soodabeh Asadi (Optim. Methods Softw., 2022)