Robert Mifflin

1.9k total citations · 1 hit paper
28 papers, 1.2k citations indexed

About

Robert Mifflin is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Robert Mifflin has authored 28 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Numerical Analysis, 22 papers in Computational Theory and Mathematics and 8 papers in Computational Mechanics. Recurrent topics in Robert Mifflin's work include Advanced Optimization Algorithms Research (24 papers), Optimization and Variational Analysis (17 papers) and Matrix Theory and Algorithms (7 papers). Robert Mifflin is often cited by papers focused on Advanced Optimization Algorithms Research (24 papers), Optimization and Variational Analysis (17 papers) and Matrix Theory and Algorithms (7 papers). Robert Mifflin collaborates with scholars based in United States, Brazil and Belgium. Robert Mifflin's co-authors include Claudia Sagastizábal, Claude Lemaréchal, Liqun Qi, Defeng Sun, Jean Jacques Strodiot, Van Hien Nguyen, J. L. Nazareth and Jian Guo and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Mathematical Programming.

In The Last Decade

Robert Mifflin

26 papers receiving 1.0k citations

Hit Papers

Semismooth and Semiconvex Functions in Constrained Optimi... 1977 2026 1993 2009 1977 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Semismooth and Semiconvex Functions in Constrained Optimization
    1977 613 citations Robert Mifflin SIAM Journal on Control and Optimization profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Robert Mifflin United States 14 914 888 365 133 108 28 1.2k
V. F. Demyanov Russia 17 707 0.8× 936 1.1× 172 0.5× 259 1.9× 186 1.7× 69 1.4k
E. S. Levitin Germany 6 388 0.4× 432 0.5× 186 0.5× 93 0.7× 59 0.5× 8 685
Paulo Roberto Oliveira Brazil 18 671 0.7× 788 0.9× 258 0.7× 70 0.5× 113 1.0× 49 991
A. Auslender France 25 1.4k 1.5× 1.6k 1.8× 565 1.5× 215 1.6× 278 2.6× 53 2.0k
O. P. Ferreira Brazil 20 951 1.0× 1.0k 1.2× 321 0.9× 77 0.6× 224 2.1× 78 1.4k
Regina S. Burachik Australia 21 954 1.0× 1.2k 1.4× 291 0.8× 160 1.2× 169 1.6× 67 1.4k
A. F. Izmailov Russia 21 1.1k 1.2× 1.0k 1.2× 164 0.4× 261 2.0× 73 0.7× 114 1.3k
Yu. E. Nesterov Belgium 8 762 0.8× 707 0.8× 299 0.8× 146 1.1× 64 0.6× 12 1.0k
Alberto Seeger France 20 732 0.8× 993 1.1× 158 0.4× 192 1.4× 362 3.4× 115 1.3k
R. Hettich Germany 11 646 0.7× 702 0.8× 171 0.5× 361 2.7× 45 0.4× 23 1.1k

Countries citing papers authored by Robert Mifflin

Since Specialization
Citations

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

Fields of papers citing papers by Robert Mifflin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Robert Mifflin

This figure shows the co-authorship network connecting the top 25 collaborators of Robert Mifflin. A scholar is included among the top collaborators of Robert Mifflin 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 Robert Mifflin. Robert Mifflin 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.
Mifflin, Robert & Claudia Sagastizábal. (2005). A -algorithm for convex minimization. Mathematical Programming. 104(2-3). 583–608. 58 indexed citations
2.
Mifflin, Robert & Claudia Sagastizábal. (2004). 𝒱𝒰-smoothness and proximal point results for some nonconvex functions. Optimization methods & software. 19(5). 463–478. 29 indexed citations
3.
Mifflin, Robert & Claudia Sagastizábal. (2003). Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions. SIAM Journal on Optimization. 13(4). 1174–1194. 26 indexed citations
4.
Mifflin, Robert & Claudia Sagastizábal. (2000). On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure. SIAM Journal on Optimization. 11(2). 547–571. 33 indexed citations
5.
Mifflin, Robert, Liqun Qi, & Defeng Sun. (1999). Properties of the Moreau-Yosida regularization of a piecewise C2 convex function. Mathematical Programming. 84(2). 269–281. 12 indexed citations
6.
Mifflin, Robert, Defeng Sun, & Liqun Qi. (1998). Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization. SIAM Journal on Optimization. 8(2). 583–603. 37 indexed citations
7.
Mifflin, Robert. (1996). A quasi-second-order proximal bundle algorithm. Mathematical Programming. 73(1). 51–72. 54 indexed citations
8.
Mifflin, Robert & J. L. Nazareth. (1994). The least prior deviation quasi-Newton update. Mathematical Programming. 65(1-3). 247–261. 13 indexed citations
9.
Mifflin, Robert & Jean Jacques Strodiot. (1989). A bracketing technique to ensure desirable convergence in univariate minimization. Mathematical Programming. 43(1-3). 117–130. 6 indexed citations
10.
Mifflin, Robert. (1984). Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization. Mathematical Programming. 28(1). 50–71. 15 indexed citations
11.
Mifflin, Robert. (1983). A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions. Mathematics of Operations Research. 8(2). 185–195. 6 indexed citations
12.
Lemaréchal, Claude & Robert Mifflin. (1982). Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. Mathematical Programming. 24(1). 241–256. 28 indexed citations
13.
Nguyen, Van Hien, Jean Jacques Strodiot, & Robert Mifflin. (1980). On conditions to have bounded multipliers in locally lipschitz programming. Mathematical Programming. 18(1). 100–106. 24 indexed citations
14.
Lemaréchal, Claude & Robert Mifflin. (1978). Nonsmooth optimization : proceedings of a IIASA workshop, March 28-April 8, 1977. IIASA PURE (International Institute of Applied Systems Analysis). 13 indexed citations
15.
Mifflin, Robert. (1977). Semismooth and Semiconvex Functions in Constrained Optimization. SIAM Journal on Control and Optimization. 15(6). 959–972. 613 indexed citations breakdown →
16.
Mifflin, Robert. (1977). An Algorithm for Constrained Optimization with Semismooth Functions. Mathematics of Operations Research. 2(2). 191–207. 141 indexed citations
17.
Mifflin, Robert. (1976). Rates of convergence for a method of centers algorithm. Journal of Optimization Theory and Applications. 18(2). 199–228. 8 indexed citations
18.
Mifflin, Robert. (1975). Convergence bounds for nonlinear programming algorithms. Mathematical Programming. 8(1). 251–271. 15 indexed citations
19.
Mifflin, Robert. (1975). A superlinearly convergent algorithm for minimization without evaluating derivatives. Mathematical Programming. 9(1). 100–117. 29 indexed citations
20.
Mifflin, Robert. (1975). Subproblem and Overall Convergence for a Method-of-Centers Algorithm. Operations Research. 23(4). 796–809. 5 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

Breakdown of academic impact, for papers by V. F. Demyanov Breakdown of academic impact, for papers by E. S. Levitin Breakdown of academic impact, for papers by Paulo Roberto Oliveira Breakdown of academic impact, for papers by A. Auslender Breakdown of academic impact, for papers by O. P. Ferreira Breakdown of academic impact, for papers by Regina S. Burachik Breakdown of academic impact, for papers by A. F. Izmailov Breakdown of academic impact, for papers by Yu. E. Nesterov Breakdown of academic impact, for papers by Alberto Seeger Breakdown of academic impact, for papers by R. Hettich
Rankless by CCL
2026