B. T. Polyak

11.3k total citations · 6 hit papers
87 papers, 6.7k citations indexed

About

B. T. Polyak is a scholar working on Control and Systems Engineering, Numerical Analysis and Computational Theory and Mathematics. According to data from OpenAlex, B. T. Polyak has authored 87 papers receiving a total of 6.7k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Control and Systems Engineering, 35 papers in Numerical Analysis and 29 papers in Computational Theory and Mathematics. Recurrent topics in B. T. Polyak's work include Stability and Control of Uncertain Systems (30 papers), Advanced Optimization Algorithms Research (25 papers) and Matrix Theory and Algorithms (17 papers). B. T. Polyak is often cited by papers focused on Stability and Control of Uncertain Systems (30 papers), Advanced Optimization Algorithms Research (25 papers) and Matrix Theory and Algorithms (17 papers). B. T. Polyak collaborates with scholars based in Russia, Italy and Portugal. B. T. Polyak's co-authors include Anatoli Juditsky, E. S. Levitin, Yurii Nesterov, Pavel Shcherbakov, Roberto Tempo, Elena Gryazina, Giuseppe C. Calafiore, Sergey A. Nazin, Yakov Z. Tsypkin and M. V. Khlebnikov and has published in prestigious journals such as IEEE Transactions on Automatic Control, IEEE Transactions on Information Theory and Automatica.

In The Last Decade

B. T. Polyak

83 papers receiving 6.2k citations

Hit Papers

5 papers align trajectories

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.

Some methods of speeding up the convergence of iteration methods

1964 1.5k citations B. T. Polyak USSR Computational Mathematics and Mathematical Physics profile →
Acceleration of Stochastic Approximation by Averaging

1992 942 citations B. T. Polyak, Anatoli Juditsky SIAM Journal on Control and Optimization profile →
The conjugate gradient method in extremal problems

1969 836 citations B. T. Polyak USSR Computational Mathematics and Mathematical Physics profile →
Constrained minimization methods

1966 538 citations B. T. Polyak et al. USSR Computational Mathematics and Mathematical Physics profile →
The method of projections for finding the common point of convex sets

1967 528 citations B. T. Polyak et al. USSR Computational Mathematics and Mathematical Physics profile →
Cubic regularization of Newton method and its global performance

2006 383 citations Yurii Nesterov, B. T. Polyak Mathematical Programming profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
B. T. Polyak Russia	25	2.4k	2.2k	1.9k	1.7k	1.2k	87	6.7k
Adrian S. Lewis United States	40	2.3k 1.0×	2.7k 1.2×	1.9k 1.0×	747 0.4×	899 0.7×	132	6.0k
Claude Lemaréchal France	29	3.0k 1.3×	3.2k 1.5×	1.8k 1.0×	754 0.4×	1.1k 0.9×	58	7.7k
Paul Tseng United States	42	3.4k 1.4×	3.5k 1.6×	2.3k 1.2×	885 0.5×	646 0.5×	103	6.7k
Kim-Chuan Toh Singapore	37	2.3k 1.0×	2.1k 1.0×	2.7k 1.5×	807 0.5×	1.1k 0.9×	142	6.9k
Yurii Nesterov Belgium	28	3.1k 1.3×	2.7k 1.2×	3.5k 1.9×	3.1k 1.9×	1.5k 1.2×	93	10.2k
Layne T. Watson United States	49	1.7k 0.7×	3.4k 1.5×	1.5k 0.8×	905 0.5×	861 0.7×	403	9.7k
Andrew R. Conn United States	33	3.7k 1.6×	3.5k 1.6×	1.7k 0.9×	1.2k 0.7×	1.5k 1.2×	91	8.4k
Jean B. Lasserre France	40	3.0k 1.3×	3.1k 1.4×	879 0.5×	923 0.5×	2.3k 1.9×	296	8.4k
Jean‐Baptiste Hiriart‐Urruty France	26	2.5k 1.1×	3.0k 1.4×	1.2k 0.6×	460 0.3×	734 0.6×	79	5.3k
Yu. Nesterov Belgium	21	1.4k 0.6×	1.0k 0.5×	2.1k 1.1×	1.6k 1.0×	355 0.3×	35	4.1k

Countries citing papers authored by B. T. Polyak

Since Specialization

Citations

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

Fields of papers citing papers by B. T. Polyak

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of B. T. Polyak

This figure shows the co-authorship network connecting the top 25 collaborators of B. T. Polyak. A scholar is included among the top collaborators of B. T. Polyak 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 B. T. Polyak. B. T. Polyak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Polyak, B. T. & M. V. Khlebnikov. (2021). Static Controller Synthesis for Peak-to-Peak Gain Minimization as an Optimization Problem. Automation and Remote Control. 82(9). 1530–1553. 5 indexed citations

Polyak, B. T. & M. V. Khlebnikov. (2017). Robust Principal Component Analysis: An IRLS Approach. IFAC-PapersOnLine. 50(1). 2762–2767. 8 indexed citations

Polyak, B. T., et al.. (2012). Regularization-based solution of the PageRank problem for large matrices. Automation and Remote Control. 73(11). 1877–1894. 11 indexed citations

Kuntsevich, Vsevolod M. & B. T. Polyak. (2009). Invariant Sets of Nonlinear Discrete Systems with Bounded Disturbances and Control Problems. Journal of Automation and Information Sciences. 41(11). 1–16. 3 indexed citations

Polyak, B. T., et al.. (2009). The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank. Doklady Mathematics. 79(3). 424–427. 2 indexed citations

Polyak, B. T. & Elena Gryazina. (2009). Randomized methods based on new Monte Carlo schemes for control and optimization. Annals of Operations Research. 189(1). 343–356. 9 indexed citations

Polyak, B. T., et al.. (2008). Invariant Ellipsoids Approach to Robust Rejection of Persistent Disturbances. IFAC Proceedings Volumes. 41(2). 3976–3981. 11 indexed citations

Polyak, B. T. & Elena Gryazina. (2008). Hit-and-Run: new design technique for stabilization, robustness and optimization of linear systems. IFAC Proceedings Volumes. 41(2). 376–380. 11 indexed citations

Nesterov, Yurii & B. T. Polyak. (2006). Cubic regularization of Newton method and its global performance. Mathematical Programming. 108(1). 177–205. 383 indexed citations breakdown →

10.

Gryazina, Elena & B. T. Polyak. (2006). Geometry of the stability domain in the parameter space: D-decomposition technique. 83. 6510–6515. 3 indexed citations

11.

Polyak, B. T. & Pavel Shcherbakov. (2006). The D-decomposition technique for linear matrix inequalities. Automation and Remote Control. 67(11). 1847–1861. 13 indexed citations

12.

Polyak, B. T., et al.. (2006). Rejection of Bounded Disturbances via Invariant Ellipsoids Technique. 1429–1434. 22 indexed citations

13.

Polyak, B. T.. (2003). The convexity principle and its applications. Bulletin of the Brazilian Mathematical Society New Series. 34(1). 59–75. 9 indexed citations

14.

Polyak, B. T. & Pavel Shcherbakov. (2002). Superstable Linear Control Systems. I. Analysis. Automation and Remote Control. 63(8). 1239–1254. 49 indexed citations

15.

Polyak, B. T.. (2002). History of mathematical programming in the USSR: analyzing the phenomenon. Mathematical Programming. 91(3). 401–416. 12 indexed citations

16.

Polyak, B. T., et al.. (1994). Comments on "Two necessary conditions for a complex polynomial to be strictly Hurwitz and their applications in robust stability analysis" [with reply]. IEEE Transactions on Automatic Control. 39(5). 1147–1148. 1 indexed citations

17.

Polyak, B. T. & Anatoli Juditsky. (1992). Acceleration of Stochastic Approximation by Averaging. SIAM Journal on Control and Optimization. 30(4). 838–855. 942 indexed citations breakdown →

18.

Polyak, B. T. & A. B. Tsybakov. (1991). Asymptotic Optimality of the $C_p$-Test for the Orthogonal Series Estimation of Regression. Theory of Probability and Its Applications. 35(2). 293–306. 25 indexed citations

19.

Polyak, B. T.. (1970). Iterative methods using lagrange multipliers for solving extremal problems with constraints of the equation type. USSR Computational Mathematics and Mathematical Physics. 10(5). 42–52. 29 indexed citations

20.

Polyak, B. T.. (1969). The conjugate gradient method in extremal problems. USSR Computational Mathematics and Mathematical Physics. 9(4). 94–112. 836 indexed citations breakdown →

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