A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION (Q5417513): Difference between revisions

Latest revision as of 13:37, 8 July 2024

scientific article; zbMATH DE number 6297382

Language	Label	Description	Also known as
English	A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION	scientific article; zbMATH DE number 6297382

Statements

instance of

scholarly article

0 references

title

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION (English)

0 references

0 references

0 references

Asian-European Journal of Mathematics

0 references

publication date

21 May 2014

0 references

zbMATH Keywords

kernel function

0 references

full-Newton step

0 references

infeasible interior-point method

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization

0 references

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

0 references

A primal-dual infeasible-interior-point algorithm for linear programming

0 references

A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function

0 references

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

0 references

New complexity analysis of IIPMs for linear optimization based on a specific self-regular function

0 references

A new primal-dual path-following interior-point algorithm for semidefinite optimization

0 references

A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization

0 references

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

Identifiers

zbMATH Open document ID

1291.90130

0 references

DOI

10.1142/S1793557114500181

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5417513

@@ Property / cites work @@
+A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
+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 @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
+Normal rank
@@ Property / cites work @@
+An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank