Zsolt Darvay

Orcid: 0000-0003-1094-9837

Affiliations:
  • Babes-Bolyai University, Cluj-Napoca, Romania


According to our database1, Zsolt Darvay authored at least 16 papers between 2016 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New Predictor-Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems.
J. Optim. Theory Appl., July, 2024

Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations.
Optim. Lett., March, 2024

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

Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique.
Eur. J. Oper. Res., 2022

2021
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation.
Optim. Lett., 2021

2020
Feasible Corrector-Predictor Interior-Point Algorithm for P<sub>*</sub> (κ)-Linear Complementarity Problems Based on a New Search Direction.
SIAM J. Optim., 2020

A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization.
Optim. Lett., 2020

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

A corrector-predictor interior-point method with new search direction for linear optimization.
Central Eur. J. Oper. Res., 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
New method for determining search directions for interior-point algorithms in linear optimization.
Optim. Lett., 2018

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier.
Comput. Optim. Appl., 2018

Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood.
Central Eur. J. Oper. Res., 2018

2016
Complexity analysis of a full-Newton step interior-point method for linear optimization.
Period. Math. Hung., 2016

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


  Loading...