{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:30:30Z","timestamp":1774870230602,"version":"3.50.1"},"reference-count":8,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T00:00:00Z","timestamp":1547510400000},"content-version":"vor","delay-in-days":14,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,7,11]]},"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If the descent direction is obtained through a classical Newton-type method, the line search is done on a majorant function. Numerical tests show the efficiency of this approach <jats:italic>versus<\/jats:italic> classical line searches.<\/jats:p>","DOI":"10.1051\/ro\/2018061","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T14:46:42Z","timestamp":1531752402000},"page":"29-38","source":"Crossref","is-referenced-by-count":5,"title":["A penalty method for nonlinear programming"],"prefix":"10.1051","volume":"53","author":[{"given":"Larbi","family":"Bachir Cherif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bachir","family":"Merikhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,1,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM J. Optimiz."},{"key":"R2","unstructured":"Bonnans J.-F., Gilbert J.-C., Lemar\u00e9chal C. and Sagastiz\u2019bal C., Numerical optimization: theoretical and practical aspects. Mathematics and Applications, Vol. 27. Springer-Verlag, Berlin (2003)."},{"key":"R3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1051\/ro:2008005","volume":"42","author":"Crouzeix","year":"2008","journal-title":"RAIRO: OR"},{"key":"R4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1006\/jmaa.1996.0029","volume":"197","author":"Crouzeix","year":"1996","journal-title":"J. Math. Anal. Appl."},{"key":"R5","unstructured":"Merikhi B., Extension de quelques m\u00e9thodes de points int\u00e9rieurs pour la programmation semi-definie. These de doctorat, Universite de Setif (2006)."},{"key":"R6","unstructured":"Ouriemchi M., R\u00e9solution de probl\u00e8mes non lin\u00e9aires par les m\u00e9thodes de points int\u00e9rieurs. Th\u00e9orie et algorithmes. These de doctorat, Universite du Havre, France (2006)."},{"key":"R7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"R8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0024-3795(80)90258-X","volume":"29","author":"Wolkowicz","year":"1980","journal-title":"Linear Algebra Appl."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018061\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T03:49:32Z","timestamp":1584676172000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":8,"journal-issue":{"issue":"1"},"alternative-id":["ro170400"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018061","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}