Roman A. Polyak

According to our database1, Roman A. Polyak authored at least 15 papers between 1992 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Lagrangian Transformation and Interior Ellipsoid Methods in Convex Optimization.
J. Optim. Theory Appl., 2015

2013
Dual fast projected gradient method for quadratic programming.
Optim. Lett., 2013

2009
On the local quadratic convergence of the primal-dual augmented Lagrangian method.
Optim. Methods Softw., 2009

Regularized Newton method for unconstrained convex optimization.
Math. Program., 2009

2008
Primal-dual exterior point method for convex optimization.
Optim. Methods Softw., 2008

1.5-Q-superlinear convergence of an exterior-point method for constrained optimization.
J. Glob. Optim., 2008

2007
Support vector machine via nonlinear rescaling method.
Optim. Lett., 2007

Confident Identification of Relevant Objects Based on Nonlinear Rescaling Method and Transductive Inference.
Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006
Primal-dual nonlinear rescaling method with dynamic scaling parameter update.
Math. Program., 2006

Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization.
Comput. Optim. Appl., 2006

2002
Nonlinear rescaling vs. smoothing technique in convex optimization.
Math. Program., 2002

2001
Log-Sigmoid Multipliers Method in Constrained Optimization.
Ann. Oper. Res., 2001

1996
Nonlinear rescaling and proximal-like methods in convex optimization.
Math. Program., 1996

1994
The convergence of a modified barrier method for convex programming.
IBM J. Res. Dev., 1994

1992
Modified barrier functions (theory and methods).
Math. Program., 1992


  Loading...