L. McLinden

416 total citations
22 papers, 307 citations indexed

About

L. McLinden is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Control and Systems Engineering. According to data from OpenAlex, L. McLinden has authored 22 papers receiving a total of 307 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 16 papers in Numerical Analysis and 3 papers in Control and Systems Engineering. Recurrent topics in L. McLinden's work include Optimization and Variational Analysis (17 papers), Advanced Optimization Algorithms Research (16 papers) and Point processes and geometric inequalities (2 papers). L. McLinden is often cited by papers focused on Optimization and Variational Analysis (17 papers), Advanced Optimization Algorithms Research (16 papers) and Point processes and geometric inequalities (2 papers). L. McLinden collaborates with scholars based in United States. L. McLinden's co-authors include O. L. Mangasarian and has published in prestigious journals such as Journal of Mathematical Analysis and Applications, Mathematical Programming and Transactions of the American Mathematical Society.

In The Last Decade

L. McLinden

18 papers receiving 257 citations

Peers

L. McLinden
L. McLinden
Citations per year, relative to L. McLinden L. McLinden (= 1×) peers Karl‐Heinz Elster

Countries citing papers authored by L. McLinden

Since Specialization
Citations

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

Fields of papers citing papers by L. McLinden

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of L. McLinden

This figure shows the co-authorship network connecting the top 25 collaborators of L. McLinden. A scholar is included among the top collaborators of L. McLinden 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 L. McLinden. L. McLinden 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
2.
McLinden, L.. (1990). Stable monotone variational inequalities. Mathematical Programming. 48(1-3). 303–338. 38 indexed citations
3.
Mangasarian, O. L. & L. McLinden. (1985). Simple bounds for solutions of monotone complementarity problems and convex programs. Mathematical Programming. 32(1). 32–40. 18 indexed citations
4.
McLinden, L.. (1984). Quasistable Parametric Optimization Without Compact Level Sets.. Defense Technical Information Center (DTIC). 2 indexed citations
5.
McLinden, L.. (1984). A Minimax Theorem. Mathematics of Operations Research. 9(4). 576–591. 18 indexed citations
6.
McLinden, L.. (1982). Successive approximation and linear stability involving convergent sequences of optimization problems. Journal of Approximation Theory. 35(4). 311–354. 9 indexed citations
7.
McLinden, L.. (1982). Polyhedral extensions of some theorems of linear programming. Mathematical Programming. 24(1). 162–176. 5 indexed citations
8.
McLinden, L.. (1982). An application of Ekeland's theorem to minimax problems. Nonlinear Analysis. 6(2). 189–196. 15 indexed citations
9.
McLinden, L., et al.. (1981). Preservation of convergence of convex sets and functions in finite dimensions. Transactions of the American Mathematical Society. 268(1). 127–127. 42 indexed citations
10.
McLinden, L.. (1980). An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem. Pacific Journal of Mathematics. 88(1). 101–161. 75 indexed citations
11.
McLinden, L.. (1978). Affine minorants minimizing the sum of convex functions. Journal of Optimization Theory and Applications. 24(4). 569–583. 7 indexed citations
12.
McLinden, L.. (1978). Symmetric Duality for Structured Convex Programs. Transactions of the American Mathematical Society. 245. 147–147. 4 indexed citations
13.
McLinden, L.. (1975). Duality Theorems and Theorems of the Alternative. Proceedings of the American Mathematical Society. 53(1). 172–172. 1 indexed citations
14.
McLinden, L.. (1975). Duality theorems and theorems of the alternative. Proceedings of the American Mathematical Society. 53(1). 172–175. 15 indexed citations
15.
McLinden, L.. (1975). Conjugacy correspondences: a unified view. Transactions of the American Mathematical Society. 203(0). 257–274. 1 indexed citations
16.
McLinden, L.. (1974). “Envelope programming” and conjugate duality. Journal of Mathematical Analysis and Applications. 47(2). 256–268. 1 indexed citations
17.
McLinden, L.. (1974). An extension of Fenchel’s duality theorem to saddle functions and dual minimax problems. Pacific Journal of Mathematics. 50(1). 135–158. 32 indexed citations
18.
McLinden, L.. (1973). Dual operations on saddle functions. Transactions of the American Mathematical Society. 179(0). 363–381. 11 indexed citations
19.
McLinden, L.. (1972). Minimax Problems, Saddle-Functions and Duality. 5 indexed citations
20.
McLinden, L.. (1972). A Decomposition Principle for Minimax Problems.. 2 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