Maryam Zangiabadi

According to our database1, Maryam Zangiabadi authored at least 17 papers between 2007 and 2023.

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

2023
How much is enough? Government subsidies in supporting green product development.
Eur. J. Oper. Res., 2023

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

2013
A Full Nesterov-Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization.
J. Optim. Theory Appl., 2013

2011
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization.
Eur. J. Oper. Res., 2011

2007
A Method for Solving Linear Programming Problems with Fuzzy Parameters Based on Multiobjective Linear Programming Technique.
Asia Pac. J. Oper. Res., 2007


  Loading...