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...
Saved in:
| Main Author: | Bendaya, M. (author) |
|---|---|
| Other Authors: | unknown (author) |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2494/1/line_search_techniques_for_the_logarithm_bendaya_isi_a1995qk46000005.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Penalty Function Algorithm For Convex Quadratic Programming
by: Bendaya, M.
Published: (2020) -
Logarithmic spiral search based arithmetic optimization algorithm with selective mechanism and its application to functional electrical stimulation system control
by: Abu Zitar, Raed
Published: (2022) -
An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem
by: Bendaya, M.
Published: (2020) -
Integrated Model For Determining The Optimal Initial Settings Of The Process Mean And The Optimal Production Run Assuming Quadratic Loss Functions
by: Rahim, M.A.
Published: (2020) -
Field Production Facility Optimization Using Sequential Quadratic Programming
by: Al-Khalifa, Hussain A
Published: (2011)