2010
DOI: 10.3923/jmmstat.2010.115.122
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Super Convergent Line Series Algorithm for Solving Unconstrained Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…To design an experiment optimally, we mean a selection of N support points within the experimental region so that the aim of the experimenter could be realized. Unlike RSM where the step length is obtained by trial and error, [9] had already modified an algorithm by [10] to solve an unconstrained optimization problems using the principle of optimal designs of experiment where the step length is obtained by taking the derivative of the response function. As by [9], a well-defined method to handle interactive effects in the case of quadratic surfaces has been provided.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To design an experiment optimally, we mean a selection of N support points within the experimental region so that the aim of the experimenter could be realized. Unlike RSM where the step length is obtained by trial and error, [9] had already modified an algorithm by [10] to solve an unconstrained optimization problems using the principle of optimal designs of experiment where the step length is obtained by taking the derivative of the response function. As by [9], a well-defined method to handle interactive effects in the case of quadratic surfaces has been provided.…”
Section: Introductionmentioning
confidence: 99%
“…Since this new technique is a line search algorithm, it relies on a well-defined method of determining the direction of search as given by [11]. The algorithmic procedure which is given in the next section requires that the optimal support points that form the initial design matrix obtained from the entire experimental region be partitioned into r groups, 2,3, , r k =  .…”
Section: Introductionmentioning
confidence: 99%
“…This new technique was brought about from super convergent line series algorithm which uses the principles of optimal designs of experiment [11] [12] and as modified by [13] (see also [14] and [15]). The algorithmic procedure used in realizing our objective in this work is as given by [10].…”
Section: Introductionmentioning
confidence: 99%
“…The initial design measure for the Maximum Norm Exchange Algorithm consists of design points selected from the boundary of the design region. Other works that apply experimental design principles for solving optimization problems include Umoren and Etukudo (2010), Osita and Iwundu (2013), Ekezie and Nzenwa (2013), Chigbu and Ukaegbu (2013), Ekezie etal. (2013), Iwundu and Hezekiah (2014), Iwundu and Ebong (2014) and Iwundu and Ndiyo (2015).…”
Section: Introductionmentioning
confidence: 99%