Soodabeh Asadi

Orcid: 0000-0002-8053-9043

According to our database1, Soodabeh Asadi authored at least 10 papers between 2013 and 2022.

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

2022
Robust piecewise linear <i>L</i><sub>1</sub>-regression via nonsmooth DC optimization.
Optim. Methods Softw., 2022

Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function.
Optim. Methods Softw., 2022

2020
A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems.
J. Optim. Theory Appl., 2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization.
CoRR, 2020

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
An interior-point algorithm for horizontal linear complementarity problems.
Int. J. Math. Oper. Res., 2018

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

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


  Loading...