Abstract
The problem of minimizing a nondifferential functionx →f(x) (subject, possibly, to nondifferential constraints) is considered. Conventional algorithms are employed for minimizing a differential approximationf∈ off (subject to differentiable approximations ofg). The parameter ɛ is adaptively reduced in such a way as to ensure convergence to points satisfying necessary conditions of optimality for the original problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
