Goran Lešaja

437 total citations
32 papers, 334 citations indexed

About

Goran Lešaja is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Goran Lešaja has authored 32 papers receiving a total of 334 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Numerical Analysis, 22 papers in Computational Theory and Mathematics and 3 papers in Artificial Intelligence. Recurrent topics in Goran Lešaja's work include Advanced Optimization Algorithms Research (25 papers), Matrix Theory and Algorithms (16 papers) and Optimization and Variational Analysis (5 papers). Goran Lešaja is often cited by papers focused on Advanced Optimization Algorithms Research (25 papers), Matrix Theory and Algorithms (16 papers) and Optimization and Variational Analysis (5 papers). Goran Lešaja collaborates with scholars based in United States, Netherlands and China. Goran Lešaja's co-authors include C. Roos, Guoqiang Wang, Florian A. Potra, Yanqin Bai, Mihai Anitescu, Nezam Mahdavi‐Amiri, Jiyuan Tao, Lingchen Kong, Anna Oganian and Bıllûr Kaymakçalan and has published in prestigious journals such as SHILAP Revista de lepidopterología, Physics Letters A and SIAM Journal on Optimization.

In The Last Decade

Goran Lešaja

31 papers receiving 309 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Goran Lešaja United States 11 284 277 34 19 15 32 334
Patrick Mehlitz Germany 11 128 0.5× 182 0.7× 38 1.1× 57 3.0× 5 0.3× 38 233
Vladimir Shikhman Germany 11 132 0.5× 142 0.5× 21 0.6× 64 3.4× 6 0.4× 30 217
L. F. Prudente Brazil 12 312 1.1× 310 1.1× 67 2.0× 50 2.6× 7 0.5× 21 374
Huynh Van Ngai Vietnam 13 258 0.9× 373 1.3× 34 1.0× 52 2.7× 12 0.8× 25 417
Max L. N. Gonçalves Brazil 11 214 0.8× 169 0.6× 90 2.6× 29 1.5× 14 0.9× 29 284
Stefan Schmieta United States 5 315 1.1× 313 1.1× 52 1.5× 53 2.8× 4 0.3× 8 375
Hezhi Luo China 11 257 0.9× 251 0.9× 87 2.6× 36 1.9× 12 0.8× 36 308
Nguyen Dong Yen Vietnam 11 248 0.9× 451 1.6× 34 1.0× 39 2.1× 6 0.4× 42 499
H. Bonnel New Caledonia 7 180 0.6× 257 0.9× 33 1.0× 74 3.9× 3 0.2× 9 290
L. R. Lucambio Pérez Brazil 9 315 1.1× 402 1.5× 76 2.2× 23 1.2× 5 0.3× 11 442

Countries citing papers authored by Goran Lešaja

Since Specialization
Citations

This map shows the geographic impact of Goran Lešaja's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Goran Lešaja with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Goran Lešaja more than expected).

Fields of papers citing papers by Goran Lešaja

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Goran Lešaja. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Goran Lešaja. The network helps show where Goran Lešaja may publish in the future.

Co-authorship network of co-authors of Goran Lešaja

This figure shows the co-authorship network connecting the top 25 collaborators of Goran Lešaja. A scholar is included among the top collaborators of Goran Lešaja based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Goran Lešaja. Goran Lešaja is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Illés, Tibor, Florian Jarre, Etienne de Klerk, & Goran Lešaja. (2024). Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. Journal of Optimization Theory and Applications. 202(1). 1–10. 1 indexed citations
2.
Wang, Guoqiang, et al.. (2023). Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for $$P_{*}(\kappa )$$-Weighted Linear Complementarity Problem. Journal of Optimization Theory and Applications. 202(1). 108–132. 1 indexed citations
3.
Oganian, Anna, et al.. (2020). Multivariate Top-Coding for Statistical Disclosure Limitation. Lecture notes in computer science. 12276. 136–148. 1 indexed citations
4.
Lešaja, Goran, et al.. (2020). On Different Formulations of a Continuous CTA Model. Lecture notes in computer science. 12276. 166–179.
5.
Lešaja, Goran, et al.. (2020). A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. Journal of Optimization Theory and Applications. 186(3). 864–878. 29 indexed citations
6.
Lešaja, Goran, et al.. (2019). A new method for finding cycles by semilinear control. Physics Letters A. 383(16). 1871–1878. 6 indexed citations
7.
Mansouri, H., et al.. (2018). A long-step interior-point algorithm for symmetric cone CartesianP*(κ)-HLCP. Optimization. 67(11). 2031–2060. 4 indexed citations
8.
Oganian, Anna, et al.. (2018). Grouping of Variables to Facilitate SDL Methods in Multivariate Data Sets. Lecture notes in computer science. ?. 187–199. 3 indexed citations
9.
Lešaja, Goran, Jordi Castro, & Anna Oganian. (2016). A Second Order Cone Formulation of Continuous CTA Model. Lecture notes in computer science. 9867. 41–53. 3 indexed citations
10.
Oganian, Anna & Goran Lešaja. (2016). Propensity Score Based Conditional Group Swapping for Disclosure Limitation of Strata-Defining Variables. Lecture notes in computer science. 6896. 69–80. 1 indexed citations
11.
Lešaja, Goran, et al.. (2016). Research and evaluation of the effectiveness of e-learning in the case of linear programming. Croatian Operational Research Review. 7(1). 109–127. 2 indexed citations
12.
Wang, Guoqiang, Lingchen Kong, Jiyuan Tao, & Goran Lešaja. (2014). Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization. Journal of Optimization Theory and Applications. 166(2). 588–604. 14 indexed citations
13.
Lešaja, Goran, et al.. (2012). INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS. SHILAP Revista de lepidopterología. 2 indexed citations
14.
Bai, Yanqin, Goran Lešaja, H. Mansouri, C. Roos, & M. Zangiabadi. (2012). Local Self-Concordance of Barrier Functions Based on Kernel Functions. 3(2). 1–23. 1 indexed citations
15.
Lešaja, Goran, et al.. (2012). Full Newton-Step Interior-Point Method for Linear Complementarity Problems. Croatian Operational Research Review. 3(1). 163–175. 2 indexed citations
16.
Lešaja, Goran, et al.. (2009). Interior-point algorithms for a class of convex optimization problems. Yugoslav journal of operations research. 19(2). 239–248. 1 indexed citations
18.
Bai, Yanqin, et al.. (2008). A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization. Journal of Optimization Theory and Applications. 138(3). 341–359. 43 indexed citations
19.
Lešaja, Goran. (2002). Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems. Yugoslav journal of operations research. 12(1). 17–48. 1 indexed citations
20.
Anitescu, Mihai, Goran Lešaja, & Florian A. Potra. (1997). Equivaence between different formulations of the linear complementarity promblem. Optimization methods & software. 7(3-4). 265–290. 32 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026