Andrew Eberhard

730 total citations
71 papers, 431 citations indexed

About

Andrew Eberhard is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Applied Mathematics. According to data from OpenAlex, Andrew Eberhard has authored 71 papers receiving a total of 431 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 20 papers in Numerical Analysis and 17 papers in Applied Mathematics. Recurrent topics in Andrew Eberhard's work include Optimization and Variational Analysis (30 papers), Advanced Optimization Algorithms Research (20 papers) and Vehicle Routing Optimization Methods (14 papers). Andrew Eberhard is often cited by papers focused on Optimization and Variational Analysis (30 papers), Advanced Optimization Algorithms Research (20 papers) and Vehicle Routing Optimization Methods (14 papers). Andrew Eberhard collaborates with scholars based in Australia, United Kingdom and Iraq. Andrew Eberhard's co-authors include Natashia Boland, Fabrício Oliveira, John Hearne, Babak Abbasi, Daniel Ralph, Angelos Tsoukalas, Robin Hill, H. Mohebi, B. M. Glover and Jeff Linderoth and has published in prestigious journals such as IEEE Transactions on Automatic Control, European Journal of Operational Research and Expert Systems with Applications.

In The Last Decade

Andrew Eberhard

65 papers receiving 406 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andrew Eberhard Australia 12 156 109 101 76 69 71 431
Rafail N. Gasimov Türkiye 13 221 1.4× 179 1.6× 130 1.3× 70 0.9× 29 0.4× 16 482
Laura Martein Italy 9 276 1.8× 243 2.2× 168 1.7× 33 0.4× 49 0.7× 32 480
Alberto Cambini Italy 9 238 1.5× 197 1.8× 132 1.3× 26 0.3× 51 0.7× 20 427
Jerzy Kyparisis United States 16 387 2.5× 268 2.5× 154 1.5× 114 1.5× 45 0.7× 23 810
U. Passy Israel 11 197 1.3× 203 1.9× 156 1.5× 75 1.0× 29 0.4× 37 604
Rosanna Manzo Italy 14 128 0.8× 36 0.3× 250 2.5× 35 0.5× 124 1.8× 98 639
Messaoud Bounkhel Saudi Arabia 13 295 1.9× 109 1.0× 69 0.7× 55 0.7× 120 1.7× 67 491
Patrice Marcotte Canada 19 599 3.8× 329 3.0× 368 3.6× 74 1.0× 87 1.3× 44 1.1k
Nasreen Kausar Türkiye 14 192 1.2× 113 1.0× 106 1.0× 27 0.4× 29 0.4× 120 753
B. Bank India 7 495 3.2× 336 3.1× 214 2.1× 24 0.3× 46 0.7× 12 743

Countries citing papers authored by Andrew Eberhard

Since Specialization
Citations

This map shows the geographic impact of Andrew Eberhard'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 Andrew Eberhard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew Eberhard more than expected).

Fields of papers citing papers by Andrew Eberhard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrew Eberhard. 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 Andrew Eberhard. The network helps show where Andrew Eberhard may publish in the future.

Co-authorship network of co-authors of Andrew Eberhard

This figure shows the co-authorship network connecting the top 25 collaborators of Andrew Eberhard. A scholar is included among the top collaborators of Andrew Eberhard 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 Andrew Eberhard. Andrew Eberhard 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.
Pham, Tan Nhat, Minh N. Dao, Andrew Eberhard, & Nargiz Sultanova. (2024). Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions. Journal of Optimization Theory and Applications. 203(2). 1622–1658. 1 indexed citations
2.
Eberhard, Andrew, et al.. (2024). Finite-Time Nonconvex Optimization Using Time-Varying Dynamical Systems. Journal of Optimization Theory and Applications. 203(1). 844–879. 1 indexed citations
3.
Eberhard, Andrew, et al.. (2024). Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems. SIAM Journal on Optimization. 34(3). 2557–2587. 1 indexed citations
4.
Chương, Thái Doãn, Xinghuo Yu, Andrew Eberhard, Chaojie Li, & Chen Liu. (2024). Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling. Journal of Global Optimization. 90(3). 781–811. 1 indexed citations
5.
Eberhard, Andrew, et al.. (2024). Representative Functions, Variational Convergence and Almost Convexity. Set-Valued and Variational Analysis. 32(1).
6.
Chương, Thái Doãn, Xinghuo Yu, Chen Liu, Andrew Eberhard, & Chaojie Li. (2024). Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations. Journal of Optimization Theory and Applications. 203(1). 676–713.
7.
Eberhard, Andrew, et al.. (2023). A study of progressive hedging for stochastic integer programming. Computational Optimization and Applications. 86(3). 989–1034. 5 indexed citations
8.
Sun, Yuan, et al.. (2023). Adaptive solution prediction for combinatorial optimization. European Journal of Operational Research. 309(3). 1392–1408. 4 indexed citations
9.
Eberhard, Andrew, et al.. (2017). On the maximal extensions of monotone operators and criteria for maximality. RMIT Research Repository (RMIT University Library). 24(1). 19–40. 1 indexed citations
10.
Eberhard, Andrew, et al.. (2015). The Transition to Online Marking in Large Classes. ResearchSpace (University of Auckland). 2015(1). 136–141. 1 indexed citations
11.
Eberhard, Andrew, Daniel Ralph, & Jean-Pierre Crouzeix. (2012). A Constructive Proof of the Existence of a Utility in Revealed Preference Theory. Mathematics of Operations Research. 1–31. 1 indexed citations
12.
Mohebi, H. & Andrew Eberhard. (2011). AN ABSTRACT CONVEX REPRESENTATION OF MAXIMAL ABSTRACT MONOTONE OPERATORS. RMIT Research Repository (RMIT University Library). 18(1). 259–275. 6 indexed citations
13.
Bačák, Miroslav, Jonathan M. Borwein, Andrew Eberhard, & Boris S. Mordukhovich. (2010). Infimal convolutions and lipschitzian properties of subdifferentials for prox-regular functions in hilbert spaces. DigitalCommons - WayneState (Wayne State University). 17(34). 737–763. 11 indexed citations
14.
Eberhard, Andrew, et al.. (2009). Some new approximation results for utilities in revealed preference theory. RMIT Research Repository (RMIT University Library).
15.
Eberhard, Andrew, et al.. (2007). Existence of closed graph, maximal, cyclic pseudo-monotone relations and revealed preference theory. Journal of Industrial and Management Optimization. 3(2). 233–255. 8 indexed citations
16.
Eberhard, Andrew, et al.. (2006). On the variational behaviour of the subhessians of the lasry-lions envelope. RMIT Research Repository (RMIT University Library). 13. 647–685. 4 indexed citations
17.
18.
Eberhard, Andrew, et al.. (2005). Comparison principles for viscosity solutions of elliptic equations via fuzzy sum rule. Journal of Mathematical Analysis and Applications. 307(2). 736–752. 6 indexed citations
19.
Eberhard, Andrew, Robin Hill, Daniel C. Ralph, & B. M. Glover. (1999). Progress in Optimization: Contributions from Australasia (Applied Optimization). 2 indexed citations
20.
Eberhard, Andrew. (1988). Characterization of subgradients, 1. Journal of Mathematical Analysis and Applications. 132(1). 57–74. 1 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