Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573): Difference between revisions

Latest revision as of 19:18, 30 December 2024

scientific article; zbMATH DE number 7801892

Language	Label	Description	Also known as
English	Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function	scientific article; zbMATH DE number 7801892

Statements

instance of

scholarly article

0 references

title

Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (English)

0 references

0 references

0 references

0 references

Boletim da Sociedade Paranaense de Matemática

0 references

publication date

8 February 2024

0 references

zbMATH Keywords

convex quadratic programming

0 references

interior point methods

0 references

kernel function

0 references

iteration bound

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.5269/bspm.47772

0 references

cites work

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

0 references

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term

0 references

Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term

0 references

Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

0 references

A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term

0 references

Interior-point algorithm for linear optimization based on a new trigonometric kernel function

0 references

Q2773659

0 references

Q4791754

0 references

Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function

0 references

Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

0 references

Q4339096

0 references

Q5691079

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6189573

@@ Property / DOI @@
-.5269/bspm.47772
@@ Property / DOI: 10.5269/bspm.47772 / rank @@
-Normal rank
@@ Property / cites work @@
+A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
+Normal rank
@@ Property / cites work @@
+An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Interior-point algorithm for linear optimization based on a new trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+Q2773659
@@ Property / cites work: Q2773659 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4791754
@@ Property / cites work: Q4791754 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
+Normal rank
@@ Property / cites work @@
+Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
+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 / DOI @@
+.5269/BSPM.47772
@@ Property / DOI: 10.5269/BSPM.47772 / rank @@
+Normal rank