Abstract
The paper presents an effective, gradient-based procedure for locating the optimum for either constrained or unconstrained response surfaces. The procedure is widely applicable covering linear and curvilinear constraints as well as constraints with redundancy. Each move of the sequence is made by pooling information from all the support points in the feasible region, making the search a global one and convergence to the global optimum almost certain.
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 callMore From: Journal of Statistics Applications & Probability
Disclaimer: 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.
