A penalty method for nonlinear programming

DOI10.1051/RO/2018061MaRDI QIDQ5380958zbMATH OpenOpenAlexFDO

Authors Larbi Bachir Cherif, B. 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 programminglogarithmic penalty methodmethod of majorant functions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 792648
• scientific article; zbMATH DE number 5524381
• On a Lagrangian penalty function method for nonlinear programming problems
• Exact penalty method with integrated consideration of the constraints
• scientific article; zbMATH DE number 3874966

Cited in

(18)

• On a Lagrangian penalty function method for nonlinear programming problems
• Methods of reduced directions, based on a differentiable penalty function, for a problem of nonlinear programming
• An interior-point algorithm for semidefinite least-squares problems.
• On penalty methods for non monotone equilibrium problems
• On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
• scientific article; zbMATH DE number 5991677 (Why is no real title available?)
• Hyperbolic Penalty: A New Method for Nonlinear Programming with Inequalities
• scientific article; zbMATH DE number 5524381 (Why is no real title available?)
• scientific article; zbMATH DE number 1306849 (Why is no real title available?)
• scientific article; zbMATH DE number 519995 (Why is no real title available?)
• scientific article; zbMATH DE number 2121552 (Why is no real title available?)
• scientific article; zbMATH DE number 792648 (Why is no real title available?)
• A self-adaptive penalty approach for nonlinear programming.
• An efficient logarithmic barrier method without line search for convex quadratic programming
• Study of a penalty method for nonlinear optimization based on a new approximate function
• A penalty method for a mixed nonlinear complementarity problem
• A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
• A new semi-penalty method for nonlinear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380958)