<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0034-7426</journal-id>
<journal-title><![CDATA[Revista Colombiana de Matemáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev.colomb.mat.]]></abbrev-journal-title>
<issn>0034-7426</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0034-74262021000100109</article-id>
<article-id pub-id-type="doi">10.15446/recolma.v55n1.99100</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Un Método de Gradiente Proyectado Espectral para el Problema de Mínimos Cuadrados Matricial Semi-definido Positivo]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Oviedo]]></surname>
<given-names><![CDATA[Harry]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Fundação Getulio Vargas  ]]></institution>
<addr-line><![CDATA[Rio de Janeiro ]]></addr-line>
<country>Brazil</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>55</volume>
<numero>1</numero>
<fpage>109</fpage>
<lpage>123</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0034-74262021000100109&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0034-74262021000100109&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0034-74262021000100109&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract This paper addresses the positive semi-definite procrustes problem (PSDP). The PSDP corresponds to a least squares problem over the set of symmetric and semi-definite positive matrices. These kinds of problems appear in many applications such as structure analysis, signal processing, among others. A non-monotone spectral projected gradient algorithm is proposed to obtain a numerical solution for the PSDP. The proposed algorithm employs the Zhang and Hager's non-monotone technique in combination with the Barzilai and Borwein's step size to accelerate convergence. Some theoretical results are presented. Finally, numerical experiments are performed to demonstrate the effectiveness and eficiency of the proposed method, and comparisons are made with other state-of-the-art algorithms.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen En este artículo abordamos el problema de mínimos cuadrados lineales sobre el conjunto de matrices simétricas y definidas positivas (PSDP). Esta clase de problemas surge en un gran número de aplicaciones tales como análisis de estructuras, procesamiento de señales, análisis de componentes principales, entre otras. Para resolver este tipo de problemas, proponemos un método de gradiente proyectado espectral no-monótono. El algoritmo propuesto usa la técnica de globalización no-monótona de Zhang y Hager, en combinación con los tamaños de paso de Barzilai y Borwein para acelerar la convergencia del método. Además, presentamos y comentamos algunos resultados teóricos concernientes al algoritmo desarrollado. Finalmente, llevamos a cabo varios experimentos numéricos con el fin de demostrar la efectividad y la eficiencia del nuevo enfoque, y realizamos comparaciones con algunos métodos existentes en la literatura.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Non-monotone algorithm]]></kwd>
<kwd lng="en"><![CDATA[Constrained optimization]]></kwd>
<kwd lng="en"><![CDATA[Symmetric positive semi-definite constraints]]></kwd>
<kwd lng="en"><![CDATA[Least-Square problems]]></kwd>
<kwd lng="es"><![CDATA[Algoritmo no-monótono]]></kwd>
<kwd lng="es"><![CDATA[optimización con restricciones]]></kwd>
<kwd lng="es"><![CDATA[restricciones simétricas y semi definidas positivas]]></kwd>
<kwd lng="es"><![CDATA[problema de mínimos cuadrados]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Andersson]]></surname>
<given-names><![CDATA[Lars-Erik]]></given-names>
</name>
<name>
<surname><![CDATA[Elfving]]></surname>
<given-names><![CDATA[Tommy]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A constrained procrustes problem]]></article-title>
<source><![CDATA[SIAM Journal on Matrix Analysis and Applications]]></source>
<year>1997</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>124-39</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bagherpour]]></surname>
<given-names><![CDATA[Negin]]></given-names>
</name>
<name>
<surname><![CDATA[Mahdavi-Amiri]]></surname>
<given-names><![CDATA[Nezam]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient algorithms for positive semi-definite total least squares problems, minimum rank problem and correlation matrix computation]]></article-title>
<source><![CDATA[arXiv preprint arXiv]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barzilai]]></surname>
<given-names><![CDATA[Jonathan]]></given-names>
</name>
<name>
<surname><![CDATA[Borwein]]></surname>
<given-names><![CDATA[Jonathan M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two-point step size gradient methods]]></article-title>
<source><![CDATA[IMA journal of numerical analysis 8]]></source>
<year>1988</year>
<volume>1</volume>
<page-range>141-8</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bertsekas]]></surname>
<given-names><![CDATA[Dimitri P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Nonlinear programming]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1997</year>
<volume>48</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>334</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brock]]></surname>
<given-names><![CDATA[John E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal matrices describing linear systems]]></article-title>
<source><![CDATA[AIAA Journal]]></source>
<year>1968</year>
<volume>6</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1292-6</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[Yu-Hong]]></given-names>
</name>
<name>
<surname><![CDATA[Fletcher]]></surname>
<given-names><![CDATA[Roger]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Projected barzilai-borwein methods for large-scale box-constrained quadratic programming]]></article-title>
<source><![CDATA[Numerische Mathematik]]></source>
<year>2005</year>
<volume>100</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-47</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Francisco]]></surname>
<given-names><![CDATA[JB]]></given-names>
</name>
<name>
<surname><![CDATA[Viloche Bazan]]></surname>
<given-names><![CDATA[FS]]></given-names>
</name>
<name>
<surname><![CDATA[Weber Mendonça]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal procrustes problem]]></article-title>
<source><![CDATA[Applied Numerical Mathematics]]></source>
<year>2017</year>
<volume>112</volume>
<page-range>51-64</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gillis]]></surname>
<given-names><![CDATA[Nicolas]]></given-names>
</name>
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[Punit]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A semi-analytical approach for the positive semidefinite procrustes problem]]></article-title>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>2018</year>
<volume>540</volume>
<page-range>112-37</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Higham]]></surname>
<given-names><![CDATA[Nicholas J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computing a nearest symmetric positive semidefinite matrix]]></article-title>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>1988</year>
<volume>103</volume>
<page-range>103-18</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liao]]></surname>
<given-names><![CDATA[Anping]]></given-names>
</name>
<name>
<surname><![CDATA[Bai]]></surname>
<given-names><![CDATA[Zhongzhi]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Least-squares solution of ax b= d over symmetric positive semidefinite matrices x]]></article-title>
<source><![CDATA[Journal of Computational Mathematics]]></source>
<year>2003</year>
<page-range>175-82</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nesterov]]></surname>
<given-names><![CDATA[Yurii]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Introductory lectures on convex programming volume i: Basic course]]></article-title>
<source><![CDATA[Lecture notes]]></source>
<year>1998</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>5</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nocedal]]></surname>
<given-names><![CDATA[orge]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[Stephen]]></given-names>
</name>
</person-group>
<source><![CDATA[Numerical optimization]]></source>
<year>2006</year>
<publisher-name><![CDATA[Springer Science &amp; Business Media]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Raydan]]></surname>
<given-names><![CDATA[Marcos]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The barzilai and borwein gradient method for the large scale unconstrained minimization problem]]></article-title>
<source><![CDATA[SIAM Journal on Optimization]]></source>
<year>1997</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>26-33</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Suffridge]]></surname>
<given-names><![CDATA[TJ]]></given-names>
</name>
<name>
<surname><![CDATA[Hayden]]></surname>
<given-names><![CDATA[TL]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximation by a hermitian positive semidefinite toeplitz matrix]]></article-title>
<source><![CDATA[SIAM Journal on Matrix Analysis and Applications]]></source>
<year>1993</year>
<volume>14</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>721-34</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Toh]]></surname>
<given-names><![CDATA[Kim-Chuan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An inexact primal-dual path following algorithm for convex quadratic sdp]]></article-title>
<source><![CDATA[Mathematical programming]]></source>
<year>2008</year>
<volume>112</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>221-54</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Toh]]></surname>
<given-names><![CDATA[Kim-Chuan]]></given-names>
</name>
<name>
<surname><![CDATA[Todd]]></surname>
<given-names><![CDATA[Michael J]]></given-names>
</name>
<name>
<surname><![CDATA[Tütüncü]]></surname>
<given-names><![CDATA[Reha H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Sdpt3a matlab software package for semidefinite programming, version 1.3]]></article-title>
<source><![CDATA[Optimization methods and software]]></source>
<year>1999</year>
<volume>11</volume>
<numero>1-4</numero>
<issue>1-4</issue>
<page-range>545-81</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Woodgate]]></surname>
<given-names><![CDATA[Keith G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Least-squares solution of f= pg over positive semidefinite symmetric p]]></article-title>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>1996</year>
<volume>245</volume>
<page-range>171-90</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Hongchao]]></given-names>
</name>
<name>
<surname><![CDATA[Hager]]></surname>
<given-names><![CDATA[William W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A nonmonotone line search technique and its application to unconstrained optimization]]></article-title>
<source><![CDATA[SIAM Journal on Optimization]]></source>
<year>2004</year>
<volume>14</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1043-56</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
