default search action
Zsolt Darvay
Person information
- affiliation: Babes-Bolyai University, Cluj-Napoca, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Zsolt Darvay
, Petra Renáta Rigó
New Predictor-Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems. J. Optim. Theory Appl. 202(1): 50-75 (2024) - [j15]Zsolt Darvay
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations. Optim. Lett. 18(2): 615-634 (2024) - 2022
- [j14]Zsolt Darvay, Tibor Illés, Petra Renáta Rigó
Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique. Eur. J. Oper. Res. 298(1): 25-35 (2022) - [j13]Soodabeh Asadi
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. 37(1): 192-213 (2022) - 2021
- [j12]Zsolt Darvay
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. Optim. Lett. 15(2): 357-376 (2021) - 2020
- [j11]Zsolt Darvay
A corrector-predictor interior-point method with new search direction for linear optimization. Central Eur. J. Oper. Res. 28(3): 1123-1140 (2020) - [j10]Soodabeh Asadi, Zsolt Darvay
A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. J. Optim. Theory Appl. 186(3): 864-878 (2020) - [j9]Zsolt Darvay
A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. Optim. Lett. 14(7): 1747-1763 (2020) - [j8]Zsolt Darvay
Feasible Corrector-Predictor Interior-Point Algorithm for P* (κ)-Linear Complementarity Problems Based on a New Search Direction. SIAM J. Optim. 30(3): 2628-2658 (2020)
2010 – 2019
- 2019
- [j7]Soodabeh Asadi
Large-Neighborhood Infeasible Predictor-Corrector Algorithm for Horizontal Linear Complementarity Problems over Cartesian Product of Symmetric Cones. J. Optim. Theory Appl. 180(3): 811-829 (2019) - [j6]Soodabeh Asadi
A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization. Optim. Methods Softw. 34(2): 336-362 (2019) - 2018
- [j5]Zsolt Darvay
Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Central Eur. J. Oper. Res. 26(3): 551-563 (2018) - [j4]Petra Renáta Rigó, Zsolt Darvay
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier. Comput. Optim. Appl. 71(2): 483-508 (2018) - [j3]Zsolt Darvay
New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12(5): 1099-1116 (2018) - 2016
- [j2]Soodabeh Asadi
On the P*(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones. Optim. Methods Softw. 31(2): 233-257 (2016) - [j1]Zsolt Darvay
Complexity analysis of a full-Newton step interior-point method for linear optimization. Period. Math. Hung. 73(1): 27-42 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: