A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920): Difference between revisions

Latest revision as of 19:09, 25 July 2024

scientific article; zbMATH DE number 7350028

Language	Label	Description	Also known as
English	A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood	scientific article; zbMATH DE number 7350028

Statements

instance of

scholarly article

0 references

title

A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (English)

0 references

author

Behrouz Kheirfam

0 references

published in

Fundamenta Informaticae

0 references

publication date

20 May 2021

0 references

zbMATH Keywords

predictor-corrector methods

0 references

interior-point methods

0 references

wide neighborhood

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A new infeasible-interior-point algorithm for linear programming over symmetric cones

0 references

A new polynomial-time algorithm for linear programming

0 references

Q4206561

0 references

Q3491304

0 references

An Implementation of a Primal-Dual Interior Point Method for Linear Programming

0 references

Computational experience with a primal-dual interior point method for linear programming

0 references

A polynomial-time algorithm for a class of linear complementarity problems

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

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

0 references

Q5691079

0 references

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity

0 references

A new $O(\sqrt{n}L)$-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

0 references

A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming

0 references

Polynomial convergence of two higher order interior-point methods for $P_*(\kappa)$-LCP in a wide neighborhood of the central path

0 references

A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function

0 references

A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood

0 references

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

0 references

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

0 references

An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization

0 references

An infeasible full-NT step interior point algorithm for CQSCO

0 references

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

0 references

A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood

0 references

A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming

0 references

A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization

0 references

A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones

0 references

A polynomial arc-search interior-point algorithm for linear programming

0 references

An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization

0 references

A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization

0 references

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

0 references

Interior Point Methods for Linear Optimization

0 references

On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms

0 references

A wide neighborhood infeasible-interior-point method with arc-search for linear programming

0 references

Identifiers

zbMATH Open document ID

1501.90112

0 references

DOI

10.3233/FI-2020-1983

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4988920

@@ Property / cites work @@
+A new infeasible-interior-point algorithm for linear programming over symmetric cones
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4206561
@@ Property / cites work: Q4206561 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+An Implementation of a Primal-Dual Interior Point Method for Linear Programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
+Normal rank
@@ Property / cites work @@
+Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
+Normal rank
@@ Property / cites work @@
+A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
+Normal rank
@@ Property / cites work @@
+A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
+Normal rank
@@ Property / cites work @@
+Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
+Normal rank
@@ Property / cites work @@
+A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
+Normal rank
@@ Property / cites work @@
+An infeasible full-NT step interior point algorithm for CQSCO
+Normal rank
@@ Property / cites work @@
+A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
+Normal rank
@@ Property / cites work @@
+A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
+Normal rank
@@ Property / cites work @@
+A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
+Normal rank
@@ Property / cites work @@
+A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
+Normal rank
@@ Property / cites work @@
+A polynomial arc-search interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization
+Normal rank
@@ Property / cites work @@
+A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization
+Normal rank
@@ Property / cites work @@
+An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
+Normal rank
@@ Property / cites work @@
+Interior Point Methods for Linear Optimization
@@ Property / cites work: Interior Point Methods for Linear Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
+Normal rank
@@ Property / cites work @@
+A wide neighborhood infeasible-interior-point method with arc-search for linear programming
+Normal rank