An interior-exterior approach for convex quadratic programming (Q436003): Difference between revisions

The authors consider the following convex quadratic programming problem \[ \min\Biggl\{c^tx+{1\over 2} x^tQx: Ax= b,\,x\geq 0\Biggr\} \] and develop a polynomial time algorithm based on the use of mixed penalties methods. -- Some numerical results are given.

0 references

reviewed by

Hans Benker

0 references

zbMATH Keywords

convex quadratic programming

0 references

interior-exterior approach

0 references

polynomial time algorithm

0 references

numerical result

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.apnum.2011.03.004

0 references

cites work

Path-Following Methods for Linear Programming

0 references

A new polynomial-time algorithm for linear programming

0 references

Q3873927

0 references

A new polynomial time method for a linear complementarity problem

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

Condition measures and properties of the central trajectory of a linear program

0 references

Q4339096

0 references

Q5691079

0 references

An extension of Karmarkar's projective algorithm for convex quadratic programming

0 references

Identifiers

zbMATH Open document ID

1256.65053

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.APNUM.2011.03.004

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:436003

@@ Property / DOI @@
-.1016/j.apnum.2011.03.004
@@ Property / DOI: 10.1016/j.apnum.2011.03.004 / rank @@
-Normal rank
@@ Property / author @@
-Safae El-Haj Ben-Ali
@@ Property / author: Safae El-Haj Ben-Ali / rank @@
-Normal rank
@@ Property / author @@
+Safae El-Haj Ben-Ali
@@ Property / author: Safae El-Haj Ben-Ali / rank @@
+Normal rank
@@ Property / review text @@
+The authors consider the following convex quadratic programming problem  \[ \min\Biggl\{c^tx+{1\over 2} x^tQx: Ax= b,\,x\geq 0\Biggr\} \]  and develop a polynomial time algorithm based on the use of mixed penalties methods. -- Some numerical results are given.
+Normal rank
@@ Property / reviewed by @@
+Hans Benker
@@ Property / reviewed by: Hans Benker / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C25
@@ Property / Mathematics Subject Classification ID: 90C25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C51
@@ Property / Mathematics Subject Classification ID: 90C51 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6055247
@@ Property / zbMATH DE Number: 6055247 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex quadratic programming
@@ Property / zbMATH Keywords: convex quadratic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+interior-exterior approach
@@ Property / zbMATH Keywords: interior-exterior approach / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial time algorithm
@@ Property / zbMATH Keywords: polynomial time algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+numerical result
@@ Property / zbMATH Keywords: numerical result / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apnum.2011.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2090094417
@@ Property / OpenAlex ID: W2090094417 / rank @@
+Normal rank
@@ Property / cites work @@
+Path-Following Methods for Linear Programming
@@ Property / cites work: Path-Following Methods for Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial time method for a linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Condition measures and properties of the central trajectory of a linear program
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank
@@ Property / DOI @@
+.1016/J.APNUM.2011.03.004
@@ Property / DOI: 10.1016/J.APNUM.2011.03.004 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:436003