In this paper, we propose a second-order corrector interior-point algorithm for semidefinite programming (SDP). This algorithm is based on the wide neighborhood. The complexity bound is <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${O(\sqrt{n}L)}$$</EquationSource> </InlineEquation> for the Nesterov-Todd direction, which coincides with the best known complexity results...</equationsource></inlineequation>

This paper is a revision of my paper, CFDP 1865. The principal innovation is an equivalent reformulation of the decision problem for weak feasibility of the GE inequalities, using polynomial time ellipsoid methods, as a semidefinite optimization problem, using polynomial time interior point...

It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is...

The stable-set problem is an NP-hard problem that arises in numerous areas such as social networking, electrical engineering, environmental forest planning, bioinformatics clustering and prediction, and computational chemistry. While some relaxations provide high-quality bounds, they result in...

In this paper we present penalty and barrier methods for solving general convex semidefinite programming problems. More precisely, the constraint set is described by a convex operator that takes its values in the cone of negative semidefinite symmetric matrices. This class of methods is an...

This paper is concerned with the analysis and comparison of semidefinite programming (SDP) relaxations for the satisfiability (SAT) problem. Our presentation is focussed on the special case of 3-SAT, but the ideas presented can in principle be extended to any instance of SAT specified by a set...

A semi-definite programming (SDP) formulation of the multi-objective economic-emission dispatch problem is presented. The fuel cost and emission functions are represented by high order polynomial functions and this was shown to be a more accurate representation of the economic-emission dispatch...

Рассматривается задача подавления внешних возмущений для линейной дискретной стационарной системы под воздействием случайных возмущений с неточно известными...

In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming.We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefiniteprogramming, resulting in a new algorithm....

In this paper we study the properties of the analytic central path of asemidefinite programming problem under perturbation of a set of inputparameters. Specifically, we analyze the behavior of solutions on the centralpath with respect to changes on the right hand side of the...