Sensitivity analysis for nonlinear programming using penalty methods

1976 ◽  
Vol 10 (1) ◽  
pp. 287-311 ◽  
Author(s):  
Anthony V. Fiacco
2019 ◽  
Vol 53 (1) ◽  
pp. 29-38
Author(s):  
Larbi Bachir Cherif ◽  
Bachir Merikhi

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 versus classical line searches.


1997 ◽  
Vol 21 (2) ◽  
pp. 113-123 ◽  
Author(s):  
S.A. Ebrahimi ◽  
D.A. Tortorelli ◽  
J.A. Dantzig

2008 ◽  
Vol 23 (2) ◽  
pp. 197-213 ◽  
Author(s):  
Richard H. Byrd ◽  
Jorge Nocedal ◽  
Richard A. Waltz

2016 ◽  
Vol 86 (306) ◽  
pp. 1793-1820 ◽  
Author(s):  
Xiao Wang ◽  
Shiqian Ma ◽  
Ya-xiang Yuan

Sign in / Sign up

Export Citation Format

Share Document