A New Penalty Function Algorithm For Convex Quadratic Programming
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an ex...
Saved in:
| Main Author: | Bendaya, M. (author) |
|---|---|
| Other Authors: | AlSultan, KS (author), unknown (author) |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2446/1/a_new_penalty_function_algorithm_for_con_bendaya_isi_a1997yb87300014.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
LINE SEARCH TECHNIQUES FOR THE LOGARITHMIC BARRIER FUNCTION IN QUADRATIC-PROGRAMMING
by: Bendaya, M.
Published: (2020) -
Some new integral inequalities for higher-order strongly exponentially convex functions
by: Jaya Bisht (17906915)
Published: (2023) -
An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem
by: Fedjki, C.A.
Published: (2020) -
Field Production Facility Optimization Using Sequential Quadratic Programming
by: Al-Khalifa, Hussain A
Published: (2011) -
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)