A penalty method for nonlinear programming

DOI10.1051/ro/2018061zbMath1414.90264OpenAlexW2884920561MaRDI QIDQ5380958

Larbi Bachir Cherif, Bachir Merikhi

Publication date: 7 June 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018061

zbMATH Keywords

convex programmingmethod of majorant functionslogarithmic penalty method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (3)

An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ An interior-point algorithm for semidefinite least-squares problems. ⋮ Unnamed Item

This page was built for publication: A penalty method for nonlinear programming