<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Affine scaling algorithm fails for semidefinite programming</dc:title>
  <dc:creator>Muramatsu, Masakazu</dc:creator>
  <dc:type>Article</dc:type>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
  <dc:date>1998</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Affine scaling algorithm</dc:subject>
  <dc:subject>Global convergence analysis</dc:subject>
  <dc:relation>Mathematical Programming</dc:relation>
  <dc:identifier>http://ddd.uab.cat/record/169</dc:identifier>
  <dc:identifier>00255610v83n3p393</dc:identifier>
  <dc:description>In this paper, we introduce an affine scaling algorithm for semidefine programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere..</dc:description>
</dc:dc>

</collection>