Nonsymmetric potential-reduction methods for general cones

نویسنده

  • Yu. Nesterov
چکیده

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 symmetric. It is important that all necessary elements of our methods can be obtained from the standard solvers for primal Newton system. The first of the proposed schemes is based on the usual affine-scaling direction. For the second one, we apply a new first-order affine-scaling direction, which incorporates in a symmetric way the gradients of primal and dual barriers. For both methods we prove the standard O( √ ν ln 12 ) complexity estimate, where ν is the parameter of the barrier and 2 is the required accuracy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NONSYMMETRIC CONICAL UPPER DENSITY AND k-POROSITY

We study how the Hausdorff measure is distributed in nonsymmetric narrow cones in Rn. As an application, we find an upper bound close to n−k for the Hausdorff dimension of sets with large k-porosity. With k-porous sets we mean sets which have holes in k different directions on every small scale.

متن کامل

Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

We describe an implementation of nonsymmetric interior-point methods for linear cone programs defined by two types of matrix cones: the cone of positive semidefinite matrices with a given chordal sparsity pattern and its dual cone, the cone of chordal sparse matrices that have a positive semidefinite completion. The implementation takes advantage of fast recursive algorithms for evaluating the ...

متن کامل

Logarithmic barriers for sparse matrix cones

Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivati...

متن کامل

Implementation in ScaLAPACK of Divide-and-Conquer Algorithms for Banded and Tridiagonal Linear Systems

Described here are the design and implementation of a family of algorithms for a variety of classes of narrowly banded linear systems. The classes of matrices include symmetric and positive de nite, nonsymmetric but diagonally dominant, and general nonsymmetric; and, all these types are addressed for both general band and tridiagonal matrices. The family of algorithms captures the general avor ...

متن کامل

Structure and arrangement of photoreceptors in the retina of big eye kilka, Clupeonella grimmi (Kessler 1877)

The big eye kilka, Clupeonella grimmi, is a marine fish living in depth of 20 to 200 meter of the Caspian Sea. Its eye and retina were processed for histological and SEM studies. Paraffin embedded retina was cut radially and tangentially in 5 ?m thickness and stained with hematoxylin and eosin method. The unstained sections were manipulated for SEM image observations. Tangential retinal sect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006