2019 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT) 2019
DOI: 10.1109/icecct.2019.8869385
|View full text |Cite
|
Sign up to set email alerts
|

On Critical Point for Functions with Bounded Parameters

Abstract: Selection of descent direction at a point plays an important role in numerical optimizationfor minimizing a real valued function. In this article, a descent sequence is generated for the functions with bounded parameters to obtain a critical point. First, sufficient condition for the existence of descent direction is studied for this function and then a set of descent directions at a point is determined using linear expansion. Using these results a descent sequence of intervals is generated and critical point … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
(15 reference statements)
0
1
0
Order By: Relevance
“…Conventional optimization techniques cannot be applied directly to solve ( CP) since the interval space is not linearly ordered. There are numerous studies in this direction over the years dealing with linear [8-10, 13, 18, 27] and nonlinear [11,14,15,21] interval optimization models in both single and multi objective cases. Most of these methods follow a common process, which transforms ( CP) to a general optimization problem through different scalarization techniques and determines the upper and lower bound of the objective function.…”
Section: Introductionmentioning
confidence: 99%
“…Conventional optimization techniques cannot be applied directly to solve ( CP) since the interval space is not linearly ordered. There are numerous studies in this direction over the years dealing with linear [8-10, 13, 18, 27] and nonlinear [11,14,15,21] interval optimization models in both single and multi objective cases. Most of these methods follow a common process, which transforms ( CP) to a general optimization problem through different scalarization techniques and determines the upper and lower bound of the objective function.…”
Section: Introductionmentioning
confidence: 99%