In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit max-structure. Our approach can be considered as an alternative to black-box...

In this paper we propose two new nonsymmetric primal-dual potential-reduction methods for conic problems. The methods are based on the primal-dual lifting [5]. This procedure allows to construct a strictly feasible primal-dual pair related by an exact scaling relation even if the cones are not...

In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz-continuous Hessian, guarantees a global rate of convergence of order O(1/k exp.2), where k is the iteration counter. Our...

In this paper we analyze computational performance of dual trigonometric generating functions on some integer programming problems. We show that if the number of equality constraints is fixed, then this technique allows to solve the problems in time, which is polynomial in the dimension of the...

In this paper we propose a new interior-point method, which is based on an extension of the ideas of self-scaled optimization to the general cases. We suggest using the primal correction process to find a scaling point. This point is used to compute a strictly feasible primal-dual pair by simple...

In many applications it is possible to justify a reasonable bound for possible variation of subgradients of objective function rather than for their uniform magnitude. In this paper we develop a new class of efficient primal-dual subgradient schemes for such problem classes.

In this paper we introduce the notions of characteristic and potential functions of directed graphs and study their properties. The main motivation for our research is the stochastic equilibrium traffic assignment problem, in which the drivers choose their routes with some probabilities. Since...

In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem....

In this paper we derive effciency estimates of the regularized Newton's method as applied to constrained convex minimization problems and to variational inequalities. We study a one- step Newton's method and its multistep accelerated version, which converges on smooth convex problems as O( 1 k3...

In this paper we develop a technique for constructing self-concordant barriers for convex cones. We start from a simple proof for a variant of standard result [1] on transformation of a -self-concordant barrier for a set into a self-concordant barrier for its conic hull with parameter (3.08 +...