In this paper, a simple feasible SQP method for nonlinear inequality constrained optimization is presented. At each iteration, we need to solve one QP subproblem only. After solving a system of linear equations, a new feasible descent direction is designed. The Maratos effect is avoided by using a h
β¦ LIBER β¦
A priority measure in interval methods for constrained global optimization
β Scribed by Zhang Jianzhong; Sha Dan
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 916 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A simple feasible SQP method for inequal
β
Zhong Jin; Yuqing Wang
π
Article
π
2010
π
Elsevier Science
π
English
β 750 KB
A deterministic global optimization algo
β
Shao-Jian Qu; Ying Ji; Ke-Cun Zhang
π
Article
π
2008
π
Elsevier Science
π
English
β 445 KB
A new method for global optimization in
β
O. Bendiab; Y. Cherruault
π
Article
π
1995
π
Elsevier Science
π
English
β 182 KB
A combined global and local search metho
β
Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao
π
Article
π
2008
π
John Wiley and Sons
π
English
β 269 KB
## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraintβfree optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some
A method for obtaining large numbers of
β
S.B. Garfinkel; W.B. Mann
π
Article
π
1968
π
Elsevier Science
β 485 KB
Method comparison on confidence interval
β
Jia-Ren Tsai; Chen-Tuo Liao
π
Article
π
2011
π
John Wiley and Sons
π
English
β 279 KB
π 3 views