| Attributs | Valeurs |
|---|
| type
| |
| Is Part Of
| |
| Subject
| |
| License
| |
| Title
| - Accelerated nonmonotone line search technique for multiobjective optimization
|
| Date
| |
| has manifestation of work
| |
| related by
| |
| Author
| |
| Abstract
| - In order to increase the probability of applying more recent information, a forgetting factor is embedded in the nonmonotone line search technique for minimization of the multiobjective problem concerning the partial order induced by a closed, convex, and pointed cone. The method is shown to be globally convergent without convexity assumption on the objective function. Moreover, to improve behavior of the classical steepest descent method, an accelerated scheme is presented. Ultimately, computational advantages of the algorithms are depicted on a class of standard test problems.
|
| article type
| |
| publisher identifier
| |
| Date Copyrighted
| |
| Rights
| - © The authors. Published by EDP Sciences, ROADEF, SMAI 2024
|
| Rights Holder
| - The authors. Published by EDP Sciences, ROADEF, SMAI
|
| is part of this journal
| |
| is primary topic
of | |
