LINE SEARCH TECHNIQUES FOR THE LOGARITHMIC BARRIER FUNCTION IN QUADRATIC-PROGRAMMING
In this paper, we propose a line-search procedure for the logarithmic barrier function in the context of an interior point algorithm for convex quadratic programming. Preliminary testing shows that the proposed procedure is superior to some other linesearch methods developed specifically for the log...
محفوظ في:
| المؤلف الرئيسي: | Bendaya, M. (author) |
|---|---|
| مؤلفون آخرون: | unknown (author) |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2494/1/line_search_techniques_for_the_logarithm_bendaya_isi_a1995qk46000005.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A New Penalty Function Algorithm For Convex Quadratic Programming
حسب: Bendaya, M.
منشور في: (2020) -
Logarithmic spiral search based arithmetic optimization algorithm with selective mechanism and its application to functional electrical stimulation system control
حسب: Abu Zitar, Raed
منشور في: (2022) -
Field Production Facility Optimization Using Sequential Quadratic Programming
حسب: Al-Khalifa, Hussain A
منشور في: (2011) -
An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem
حسب: Bendaya, M.
منشور في: (2020) -
Integrated Model For Determining The Optimal Initial Settings Of The Process Mean And The Optimal Production Run Assuming Quadratic Loss Functions
حسب: Rahim, M.A.
منشور في: (2020)