Asadi, S.; Mahdavi-Amiri, N.; Darvay, Zs.; Rigó, P. R. Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. (English) Zbl 1501.90110 Optim. Methods Softw. 37, No. 1, 192-213 (2022). MSC: 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} et al., Optim. Methods Softw. 37, No. 1, 192--213 (2022; Zbl 1501.90110) Full Text: DOI
Asadi, Soodabeh; Darvay, Zsolt; Lesaja, Goran; Mahdavi-Amiri, Nezam; Potra, Florian A full-Newton step interior-point method for monotone weighted linear complementarity problems. (English) Zbl 1441.90163 J. Optim. Theory Appl. 186, No. 3, 864-878 (2020). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., J. Optim. Theory Appl. 186, No. 3, 864--878 (2020; Zbl 1441.90163) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein A Mehrotra type predictor-corrector interior-point algorithm for linear programming. (English) Zbl 1427.90198 Numer. Algebra Control Optim. 9, No. 2, 147-156 (2019). MSC: 90C05 90C51 PDFBibTeX XMLCite \textit{S. Asadi} and \textit{H. Mansouri}, Numer. Algebra Control Optim. 9, No. 2, 147--156 (2019; Zbl 1427.90198) Full Text: DOI
Asadi, S.; Mansouri, H.; Zangiabadi, M. A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions. (English) Zbl 1418.90260 Acta Math. Appl. Sin., Engl. Ser. 35, No. 2, 359-373 (2019). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Acta Math. Appl. Sin., Engl. Ser. 35, No. 2, 359--373 (2019; Zbl 1418.90260) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Darvay, Zsolt; Zangiabadi, Maryam; Mahdavi-Amiri, Nezam Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones. (English) Zbl 1409.90198 J. Optim. Theory Appl. 180, No. 3, 811-829 (2019). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., J. Optim. Theory Appl. 180, No. 3, 811--829 (2019; Zbl 1409.90198) Full Text: DOI
Asadi, S.; Mansouri, H.; Darvay, Zs.; Lesaja, G.; Zangiabadi, M. A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization. (English) Zbl 1407.90345 Optim. Methods Softw. 34, No. 2, 336-362 (2019). MSC: 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} et al., Optim. Methods Softw. 34, No. 2, 336--362 (2019; Zbl 1407.90345) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Zangiabadi, Maryam An interior-point algorithm for horizontal linear complementarity problems. (English) Zbl 1452.90302 Int. J. Math. Oper. Res. 13, No. 1, 30-46 (2018). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Int. J. Math. Oper. Res. 13, No. 1, 30--46 (2018; Zbl 1452.90302) Full Text: DOI
Asadi, S.; Mansouri, H.; Lesaja, G.; Zangiabadi, M. A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP. (English) Zbl 1416.90049 Optimization 67, No. 11, 2031-2060 (2018). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Optimization 67, No. 11, 2031--2060 (2018; Zbl 1416.90049) Full Text: DOI
Zangiabadi, Maryam; Asadi, Soodabeh; Mansouri, Hossein Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation. (English) Zbl 1362.90311 Int. J. Oper. Res. 28, No. 2, 290-306 (2017). MSC: 90C22 17C55 90C51 PDFBibTeX XMLCite \textit{M. Zangiabadi} et al., Int. J. Oper. Res. 28, No. 2, 290--306 (2017; Zbl 1362.90311) Full Text: DOI
Asadi, S.; Zangiabadi, M.; Mansouri, H. A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones. (English) Zbl 1362.90349 Numer. Funct. Anal. Optim. 38, No. 1, 20-38 (2017). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Numer. Funct. Anal. Optim. 38, No. 1, 20--38 (2017; Zbl 1362.90349) Full Text: DOI
Asadi, S.; Mansouri, H.; Darvay, Zs. An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones. (English) Zbl 1392.90114 Optimization 66, No. 2, 225-250 (2017). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Optimization 66, No. 2, 225--250 (2017; Zbl 1392.90114) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Zangiabadi, Maryam An adaptive primal-dual full-Newton step infeasible interior-point algorithm for linear optimization. (English) Zbl 1358.90154 Bull. Korean Math. Soc. 53, No. 6, 1831-1844 (2016). MSC: 90C51 90C05 49M15 PDFBibTeX XMLCite \textit{S. Asadi} et al., Bull. Korean Math. Soc. 53, No. 6, 1831--1844 (2016; Zbl 1358.90154) Full Text: DOI
Asadi, S.; Mansouri, H.; Darvay, Zs.; Zangiabadi, M. On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones. (English) Zbl 1368.90182 Optim. Methods Softw. 31, No. 2, 233-257 (2016). MSC: 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} et al., Optim. Methods Softw. 31, No. 2, 233--257 (2016; Zbl 1368.90182) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Zangiabadi, Maryam A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function. (English) Zbl 1338.90404 J. Oper. Res. Soc. China 4, No. 1, 77-96 (2016). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., J. Oper. Res. Soc. China 4, No. 1, 77--96 (2016; Zbl 1338.90404) Full Text: DOI
Mohammadi, N.; Mansouri, H.; Zangiabadi, M.; Asadi, S. A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian \(P_\ast(\kappa)\) horizontal linear complementarity problems over symmetric cones. (English) Zbl 1370.90274 Optimization 65, No. 2, 539-565 (2016). MSC: 90C33 90C51 65K05 PDFBibTeX XMLCite \textit{N. Mohammadi} et al., Optimization 65, No. 2, 539--565 (2016; Zbl 1370.90274) Full Text: DOI
Asadi, S.; Zangiabadi, M.; Mansouri, H. An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function. (English) Zbl 1330.90133 J. Appl. Math. Comput. 50, No. 1-2, 15-37 (2016). MSC: 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} et al., J. Appl. Math. Comput. 50, No. 1--2, 15--37 (2016; Zbl 1330.90133) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein A full-Newton step infeasible-interior-point algorithm for \(P*(\kappa)\)-horizontal linear complementarity problems. (English) Zbl 1474.90468 Yugosl. J. Oper. Res. 25, No. 1, 57-72 (2015). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} and \textit{H. Mansouri}, Yugosl. J. Oper. Res. 25, No. 1, 57--72 (2015; Zbl 1474.90468) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Darvay, Zsolt An infeasible interior-point method with improved centering steps for monotone linear complementarity problems. (English) Zbl 1326.90085 Asian-Eur. J. Math. 8, No. 3, Article ID 1550037, 9 p. (2015). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} et al., Asian-Eur. J. Math. 8, No. 3, Article ID 1550037, 9 p. (2015; Zbl 1326.90085) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein; Zangiabadi, Maryam A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems. (English) Zbl 1317.90324 J. Oper. Res. Soc. China 3, No. 1, 17-30 (2015). MSC: 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} et al., J. Oper. Res. Soc. China 3, No. 1, 17--30 (2015; Zbl 1317.90324) Full Text: DOI
Asadi, Soodabeh; Mansouri, Hossein A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems. (English) Zbl 1320.90090 Comput. Sci. J. Mold. 22, No. 1(64), 37-61 (2014). MSC: 90C33 90C51 PDFBibTeX XMLCite \textit{S. Asadi} and \textit{H. Mansouri}, Comput. Sci. J. Mold. 22, No. 1(64), 37--61 (2014; Zbl 1320.90090) Full Text: Link
Asadi, S.; Mansouri, H. Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems. (English) Zbl 1332.65075 Numer. Algorithms 63, No. 2, 385-398 (2013). MSC: 65K05 90C51 90C33 PDFBibTeX XMLCite \textit{S. Asadi} and \textit{H. Mansouri}, Numer. Algorithms 63, No. 2, 385--398 (2013; Zbl 1332.65075) Full Text: DOI