<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Certifying solutions of degenerate semidefinite programs</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Vladimir</namePart>
  <namePart type="family">Kolmogorov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3D50B0BA-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Simone</namePart>
  <namePart type="family">Naldi</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jeferson</namePart>
  <namePart type="family">Zapata</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">00223538-AF8F-11E9-A4C7-F729E6697425</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">VlKo</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Vienna Graduate School on Computational Optimization</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We consider the problem of certifying the feasibility of a (possibly degenerate) semidefinite programming problem represented by rational input data together with a numerical solution that is guaranteed to be sufficiently close to an exact solution of maximal rank. Our method constructs a polynomial system whose set of real solutions has an isolated point that satisfies the input program. An experimental comparison between the corresponding symbolic-numerical algorithm and the purely symbolic algorithm from [3, 5] shows that the hybrid algorithm is able to certify instances where the exact method fails.</abstract>

<originInfo><publisher>ACM</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>ACM Communications in Computer Algebra</title></titleInfo>
  <identifier type="issn">1932-2232</identifier>
  <identifier type="eIssn">1932-2240</identifier><identifier type="doi">10.1145/3832046.3832063</identifier>
<part><detail type="volume"><number>59</number></detail><detail type="issue"><number>4</number></detail><extent unit="pages">147-152</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<mla>Kolmogorov, Vladimir, et al. “Certifying Solutions of Degenerate Semidefinite Programs.” &lt;i&gt;ACM Communications in Computer Algebra&lt;/i&gt;, vol. 59, no. 4, ACM, 2025, pp. 147–52, doi:&lt;a href=&quot;https://doi.org/10.1145/3832046.3832063&quot;&gt;10.1145/3832046.3832063&lt;/a&gt;.</mla>
<ieee>V. Kolmogorov, S. Naldi, and J. Zapata, “Certifying solutions of degenerate semidefinite programs,” &lt;i&gt;ACM Communications in Computer Algebra&lt;/i&gt;, vol. 59, no. 4. ACM, pp. 147–152, 2025.</ieee>
<ama>Kolmogorov V, Naldi S, Zapata J. Certifying solutions of degenerate semidefinite programs. &lt;i&gt;ACM Communications in Computer Algebra&lt;/i&gt;. 2025;59(4):147-152. doi:&lt;a href=&quot;https://doi.org/10.1145/3832046.3832063&quot;&gt;10.1145/3832046.3832063&lt;/a&gt;</ama>
<short>V. Kolmogorov, S. Naldi, J. Zapata, ACM Communications in Computer Algebra 59 (2025) 147–152.</short>
<apa>Kolmogorov, V., Naldi, S., &amp;#38; Zapata, J. (2025). Certifying solutions of degenerate semidefinite programs. &lt;i&gt;ACM Communications in Computer Algebra&lt;/i&gt;. ACM. &lt;a href=&quot;https://doi.org/10.1145/3832046.3832063&quot;&gt;https://doi.org/10.1145/3832046.3832063&lt;/a&gt;</apa>
<ista>Kolmogorov V, Naldi S, Zapata J. 2025. Certifying solutions of degenerate semidefinite programs. ACM Communications in Computer Algebra. 59(4), 147–152.</ista>
<chicago>Kolmogorov, Vladimir, Simone Naldi, and Jeferson Zapata. “Certifying Solutions of Degenerate Semidefinite Programs.” &lt;i&gt;ACM Communications in Computer Algebra&lt;/i&gt;. ACM, 2025. &lt;a href=&quot;https://doi.org/10.1145/3832046.3832063&quot;&gt;https://doi.org/10.1145/3832046.3832063&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22774</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-08-30T22:01:44Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-09-09T08:17:05Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
