Nonparametric multiple comparison procedures for ordered parameters in balanced incomplete blocks. - Hossein Mansouri; Carrie Shaw (Comput. Stat. Data Anal., 2004)

Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps. - Hossein Mansouri; Cornelis Roos (Optim. Methods Softw., 2007)

A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. - Hossein Mansouri; Cornelis Roos (Numer. Algorithms, 2009)

Full-Newton step infeasible interior-point algorithm for SDO problems. - Hossein Mansouri (Kybernetika, 2012)

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems. - Hossein Mansouri; Mohammad Pirhaji (J. Optim. Theory Appl., 2013)

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)

A Large-Update Interior-Point Method for Cartesian P ∗(κ)-LCP Over Symmetric Cones. - Maryam Zangiabadi; M. Sayadi Shahraki; Hossein Mansouri (J. Math. Model. Algorithms Oper. Res., 2014)

A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems. - Hossein Mansouri; Maryam Zangiabadi; M. Arzani (J. Optim. Theory Appl., 2015)

A New Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming Based on a Wide Neighbourhood. - M. Sayadi Shahraki; Hossein Mansouri; Maryam Zangiabadi (J. Optim. Theory Appl., 2016)

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 ℓ2-neighborhood infeasible interior-point algorithm for linear complementarity problems. - Mohammad Pirhaji; Maryam Zangiabadi; Hossein Mansouri (4OR, 2017)

Two wide neighborhood interior-point methods for symmetric cone optimization. - M. Sayadi Shahraki; Hossein Mansouri; Maryam Zangiabadi (Comput. Optim. Appl., 2017)

A primal-dual predictor-corrector interior-point method for symmetric cone programming with O(√r log ϵ-1) iteration complexity. - M. Sayadi Shahraki; Hossein Mansouri; Maryam Zangiabadi (Int. J. Comput. Math., 2017)

A full NT-step infeasible interior-point algorithm for semidefinite optimization. - Mohammad Pirhaji; Hossein Mansouri; Maryam Zangiabadi (RAIRO Oper. Res., 2017)

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

An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones. - Mohammad Pirhaji; Maryam Zangiabadi; Hossein Mansouri; Saman Hassanzadeh Amin (Math. Model. Anal., 2018)

A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization. - M. Sayadi Shahraki; Hossein Mansouri; Maryam Zangiabadi; N. Mahdavi-Amiri (Numer. Algorithms, 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)