Hossein Mansouri

Orcid: 0000-0001-7921-8501

According to our database1, Hossein Mansouri authored at least 20 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization.
Optim. Methods Softw., 2019

Large-Neighborhood Infeasible Predictor-Corrector Algorithm for Horizontal Linear Complementarity Problems over Cartesian Product of Symmetric Cones.
J. Optim. Theory Appl., 2019

2018
A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization.
Numer. Algorithms, 2018

An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones.
Math. Model. Anal., 2018

An interior-point algorithm for horizontal linear complementarity problems.
Int. J. Math. Oper. Res., 2018

2017
A full NT-step infeasible interior-point algorithm for semidefinite optimization.
RAIRO Oper. Res., 2017

A primal-dual predictor-corrector interior-point method for symmetric cone programming with O(√r log ϵ-1) iteration complexity.
Int. J. Comput. Math., 2017

Two wide neighborhood interior-point methods for symmetric cone optimization.
Comput. Optim. Appl., 2017

An ℓ<sub>2</sub>-neighborhood infeasible interior-point algorithm for linear complementarity problems.
4OR, 2017

2016
On the <i>P<sub>*</sub>(κ)</i> horizontal linear complementarity problems over Cartesian product of symmetric cones.
Optim. Methods Softw., 2016

A New Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming Based on a Wide Neighbourhood.
J. Optim. Theory Appl., 2016

2015
A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems.
J. Optim. Theory Appl., 2015

2014
A Large-Update Interior-Point Method for Cartesian P ∗(κ)-LCP Over Symmetric Cones.
J. Math. Model. Algorithms Oper. Res., 2014

A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P<sub>*</sub>(κ)-horizontal Linear Complementarity Problems.
Comput. Sci. J. Moldova, 2014

2013
Polynomial interior-point algorithm for P<sub>*</sub>(κ) horizontal linear complementarity problems.
Numer. Algorithms, 2013

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems.
J. Optim. Theory Appl., 2013

2012
Full-Newton step infeasible interior-point algorithm for SDO problems.
Kybernetika, 2012

2009
A new full-Newton step <i>O</i>(<i>n</i>) infeasible interior-point algorithm for semidefinite optimization.
Numer. Algorithms, 2009

2007
Simplified <i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps.
Optim. Methods Softw., 2007

2004
Nonparametric multiple comparison procedures for ordered parameters in balanced incomplete blocks.
Comput. Stat. Data Anal., 2004


  Loading...