On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series

DOI10.1080/03610926.2012.661510OpenAlexW2088446599MaRDI QIDQ2815362

No author found.

Publication date: 28 June 2016

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2012.661510

zbMATH Keywords

optimal solutionssupport pointsresponse surfacesnon-overlapping segmentationsuper convergent line series

Mathematics Subject Classification ID

Design of statistical experiments (62Kxx)

Related Items (max. 100)

An algorithm for the simultaneous construction ofD-optimal experimental designs

Cites Work

• Unnamed Item
• A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• An efficient Newton's method for optimization under equality constraints
• Convergence of conjugate gradient methods with a closed-form stepsize formula
• Response Surface Methodology: 1966-1988
• Global Maximization of a Convex Function with Linear Inequality Constraints
• A Biometrics Invited Paper. A Review of Response Surface Methodology from a Biometric Viewpoint
• A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients

This page was built for publication: On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series