Roman A. Polyak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Roman A. Polyak has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Igor Griva
Department of Mathematical Science George Mason University
4 shared publications Igor Griva
George Mason University
1 shared publicationJames Costa
George Mason University
1 shared publicationSaba Neyshabouri
George Mason University
1 shared publication- Shen-Shyang Ho
Rowan University, Glassboro, New Jersey, USA
1 shared publication
Latest Publications
- 20 October 2025
- Published by Springer Nature
- p. 77-97
Finding Nonlinear Production–Consumption Equilibrium
- 20 October 2025
- Published by Springer Nature
- p. 77-97
Finding Nonlinear Production–Consumption Equilibrium
- Open Access
- 26 July 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 207 (2) , 1-34
Finding Equilibrium in Some Economics and Game Models
We consider numerical aspects of finding classical J. Nash’s equilibrium in concave n-persons game, nonlinear equilibrium (NE), as an alternative to primal and dual linear programming (LP) problems, and recently introduced nonlinear production-consumption equilibrium (NPCE). The problems are particular cases of a general nonlinear equilibrium problem, which is equivalent to a variational inequality (VI). The corresponding VIs have simple feasible sets, that the projection on them is a low cost operation. Therefore, we apply two projection methods for finding the equilibrium: pseudo-gradient projection (PGP) and extra pseudo-gradient (EPG). We present and analyze results obtained on random generated sets of these three classes of problems. The obtained results show expected advantages of the EPG over PGP. What is most important: the number of iterations requited by EPG method to find an approximation for the equilibrium with a given accuracy grows linearly with the number of products in case of NE and NPCE, or with the number of active strategies in case of J. Nash’s equilibrium. The number of operations, or solution time grows as a cube of the corresponding parameters. These results corroborate the complexity bounds established in [18–20] under reasonable assumptions on the input data.
- 26 July 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 207 (2) , 1-34
Open AccessFinding Equilibrium in Some Economics and Game Models
We consider numerical aspects of finding classical J. Nash’s equilibrium in concave n-persons game, nonlinear equilibrium (NE), as an alternative to primal and dual linear programming (LP) problems, and recently introduced nonlinear production-consumption equilibrium (NPCE). The problems are particular cases of a general nonlinear equilibrium problem, which is equivalent to a variational inequality (VI). The corresponding VIs have simple feasible sets, that the projection on them is a low cost operation. Therefore, we apply two projection methods for finding the equilibrium: pseudo-gradient projection (PGP) and extra pseudo-gradient (EPG). We present and analyze results obtained on random generated sets of these three classes of problems. The obtained results show expected advantages of the EPG over PGP. What is most important: the number of iterations requited by EPG method to find an approximation for the equilibrium with a given accuracy grows linearly with the number of products in case of NE and NPCE, or with the number of active strategies in case of J. Nash’s equilibrium. The number of operations, or solution time grows as a cube of the corresponding parameters. These results corroborate the complexity bounds established in [18–20] under reasonable assumptions on the input data.
- 21 April 2012
- Published by Springer Nature in Optimization Letters
- Vol. 7 (4) , 631-645
Dual fast projected gradient method for quadratic programming
- 21 April 2012
- Published by Springer Nature in Optimization Letters
- Vol. 7 (4) , 631-645
Dual fast projected gradient method for quadratic programming
- Open Access
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 1 (2) , 283-299
Proximal point nonlinear rescaling method for convex optimization
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 1 (2) , 283-299
Open AccessProximal point nonlinear rescaling method for convex optimization
- 8 May 2009
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 24 (3) , 369-379
On the local quadratic convergence of the primal–dual augmented Lagrangian method
We consider a primal–dual augmented Lagrangian (PDAL) method for optimization problems with equality constraints. Each step of the PDAL requires solving the primal–dual (PD) linear system of equations. We show that under the standard second-order optimality condition the PDAL method generates a sequence, which locally converges to the PD solution with quadratic rate.
- 8 May 2009
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 24 (3) , 369-379
On the local quadratic convergence of the primal–dual augmented Lagrangian method
We consider a primal–dual augmented Lagrangian (PDAL) method for optimization problems with equality constraints. Each step of the PDAL requires solving the primal–dual (PD) linear system of equations. We show that under the standard second-order optimality condition the PDAL method generates a sequence, which locally converges to the PD solution with quadratic rate.
- 16 June 2007
- Published by Springer Nature in Mathematical Programming
- Vol. 120 (1) , 125-145
Regularized Newton method for unconstrained convex optimization
- 16 June 2007
- Published by Springer Nature in Mathematical Programming
- Vol. 120 (1) , 125-145
Regularized Newton method for unconstrained convex optimization
- 6 December 2006
- Published by Springer Nature in Journal of Global Optimization
- Vol. 40 (4) , 679-695
1.5-Q-superlinear convergence of an exterior-point method for constrained optimization
- 6 December 2006
- Published by Springer Nature in Journal of Global Optimization
- Vol. 40 (4) , 679-695
1.5-Q-superlinear convergence of an exterior-point method for constrained optimization
- 11 November 2006
- Published by Springer Nature in Optimization Letters
- Vol. 1 (4) , 367-378
Support vector machine via nonlinear rescaling method
- 11 November 2006
- Published by Springer Nature in Optimization Letters
- Vol. 1 (4) , 367-378
Support vector machine via nonlinear rescaling method
- 7 June 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 106 (2) , 237-259
Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- 7 June 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 106 (2) , 237-259
Primal-dual nonlinear rescaling method with dynamic scaling parameter update