{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1587941","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1587941","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1587941","kernelVersion":"v1","immutable":true,"modified":"2025-07-22T14:41:56Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1587941","name":"Failure of global convergence for a class of interior point methods for nonlinear programming","headline":"Failure of global convergence for a class of interior point methods for nonlinear programming","description":"scientific article; zbMATH DE number 1538619","url":"https://portal.mardi4nfdi.de/entity/Q1587941","datePublished":"2001-07-03","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q785625"},{"@id":"https://portal.mardi4nfdi.de/entity/Q400062"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q163006"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S101070000181","url":"https://doi.org/10.1007/S101070000181"},"sameAs":["https://doi.org/10.1007/S101070000181"],"comment":"The authors consider nonlinear nonconvex optimization problems of the form  \\[ \\min_{x\\in\\mathbb{R}^n} f(x),\\quad c(x)= 0,\\quad x_i\\geq 0. \\]  For these problems, they demonstrate that a class of interior point methods is not globally convergent. It is shown that these algorithms produce limit points that are neither feasible nor stationary points."},"provenance":{"prov:generatedAtTime":"2025-07-22T14:41:56Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}