Modified barrier functions (theory and methods). - Roman A. Polyak (Math. Program., 1992)

The convergence of a modified barrier method for convex programming. - David L. Jensen; Roman A. Polyak (IBM J. Res. Dev., 1994)

Nonlinear rescaling and proximal-like methods in convex optimization. - Roman A. Polyak; Marc Teboulle (Math. Program., 1996)

Log-Sigmoid Multipliers Method in Constrained Optimization. - Roman A. Polyak (Ann. Oper. Res., 2001)

Nonlinear rescaling vs. smoothing technique in convex optimization. - Roman A. Polyak (Math. Program., 2002)

Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization. - Roman A. Polyak (Comput. Optim. Appl., 2006)

Primal-dual nonlinear rescaling method with dynamic scaling parameter update. - Igor Griva; Roman A. Polyak (Math. Program., 2006)

Confident Identification of Relevant Objects Based on Nonlinear Rescaling Method and Transductive Inference. - Shen-Shyang Ho; Roman A. Polyak (ICDM, 2007)

Support vector machine via nonlinear rescaling method. - Roman A. Polyak; Shen-Shyang Ho; Igor Griva (Optim. Lett., 2007)

1.5-Q-superlinear convergence of an exterior-point method for constrained optimization. - Igor Griva; Roman A. Polyak (J. Glob. Optim., 2008)

Primal-dual exterior point method for convex optimization. - Roman A. Polyak (Optim. Methods Softw., 2008)

Regularized Newton method for unconstrained convex optimization. - Roman A. Polyak (Math. Program., 2009)

On the local quadratic convergence of the primal-dual augmented Lagrangian method. - Roman A. Polyak (Optim. Methods Softw., 2009)

Dual fast projected gradient method for quadratic programming. - Roman A. Polyak; James Costa; Saba Neyshabouri (Optim. Lett., 2013)

Lagrangian Transformation and Interior Ellipsoid Methods in Convex Optimization. - Roman A. Polyak (J. Optim. Theory Appl., 2015)