A penalty method for nonlinear programming
RAIRO-Oper. Res., 53 1 (2019) 29-38
Published online: 2019-01-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
An Efficient Penalty Method without a Line Search for Nonlinear Optimization
Assma LeulmiAxioms 13 (3) 176 (2024)
https://doi.org/10.3390/axioms13030176
Position Correction Algorithm of Well Pads When Solving the Problem of Developing Oil Fields
Artem Fedoreev, Artem Shutalev, Aleksandr Sarenkov, Anton Mikhalev and Egor KulakovInformatics and Automation 22 (2) 447 (2023)
https://doi.org/10.15622/ia.22.2.8
An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming
S. Chaghoub and D. BenterkiNumerical Analysis and Applications 15 (2) 156 (2022)
https://doi.org/10.1134/S1995423922020070
Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
Soraya Chaghoub and Djamel BenterkiJournal of Numerical Analysis and Approximation Theory 49 (1) 15 (2020)
https://doi.org/10.33993/jnaat491-1199