Newton-Type Methods for the Approximate Solution of Nonlinear Programming Problems in Real-Time

2003 ◽  
pp. 177-200 ◽  
Author(s):  
Moritz Diehl ◽  
H. Georg Bock ◽  
Johannes P. Schlöder
Keyword(s):  
Approximate Solution ◽  
Nonlinear Programming ◽  
Real Time

scholarly journals Best Proximity Points for Some Classes of Proximal Contractions

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Maryam A. Alghamdi ◽  
Naseer Shahzad ◽  
Francesca Vetro
Keyword(s):  
Approximate Solution ◽  
Nonlinear Programming ◽  
Programming Problem ◽  
Iterative Algorithm ◽  
Best Proximity Point ◽  
Sufficient Conditions ◽  
Nonlinear Programming Problem ◽  
Optimal Approximate Solution ◽  
Unique Point ◽  
Banach’S Contraction Principle

Given a self-mapping and a non-self-mapping , the aim of this work is to provide sufficient conditions for the existence of a unique point , calledg-best proximity point, which satisfies . In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function , thereby getting an optimal approximate solution to the equation . An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-self-mappings.

Sign in / Sign up

Export Citation Format

Share Document