Solodov M.V.

M.V. Solodov

Information about the author M.V. Solodov will soon be added to the site.
Found 10 papers in total
On the sequential quadratically constrained quadratic programming methods
On the sequential quadratically constrained quadratic programming methods
2004
An iteration of the sequential quadratically constrained quadratic programming method...
Convergence rate analysis of interactive algorithms for solving variational inequality problems
Convergence rate analysis of interactive algorithms for solving variational inequality problems
2003
We present a unified convergence rate analysis of iterative methods for solving the...
Karush–Kuhn–Tucker systems: Regularity conditions, error bounds and a class of Newton-type methods
Karush–Kuhn–Tucker systems: Regularity conditions, error bounds and a class of Newton-type methods
2003
We consider optimality systems of Karush–Kuhn–Tucker (KKT) type, which...
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
2002
We study local structure of a nonlinear mapping near points where standard regularity...
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
2001
We obtain local estimates of the distance to a set defined by equality constraints...
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
2000
We study various error measures for approximate solution of proximal point...
Forcing strong convergence of proximal point iterations in a Hilbert space
Forcing strong convergence of proximal point iterations in a Hilbert space
2000
This paper concerns the convergence properties of the classical proximal point...
Incremental gradient algorithms with stepsizes bounded away from zero
Incremental gradient algorithms with stepsizes bounded away from zero
1998
We consider the class of incremental gradient methods for minimizing a sum of...
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
1998
We consider the method for constrained convex optimization in a Hilbert space,...
Nonlinear complementarity as unconstrained and constrained minimization
Nonlinear complementarity as unconstrained and constrained minimization
1993
The nonlinear complementarity problem is cast as an unconstrained minimization problem...
Papers per page: