A penalty method for nonlinear programming
From MaRDI portal
Publication:5380958
DOI10.1051/RO/2018061zbMATH Open1414.90264OpenAlexW2884920561MaRDI QIDQ5380958FDOQ5380958
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
Recommendations
Cited In (17)
- On penalty methods for non monotone equilibrium problems
- Title not available (Why is that?)
- An efficient logarithmic barrier method without line search for convex quadratic programming
- An interior-point algorithm for semidefinite least-squares problems.
- A new semi-penalty method for nonlinear programming
- A self-adaptive penalty approach for nonlinear programming.
- Title not available (Why is that?)
- Methods of reduced directions, based on a differentiable penalty function, for a problem of nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hyperbolic Penalty: A New Method for Nonlinear Programming with Inequalities
- A penalty method for a mixed nonlinear complementarity problem
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- Title not available (Why is that?)
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
