An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306): Difference between revisions

Latest revision as of 00:35, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem	scientific article

Statements

instance of

scholarly article

0 references

title

An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (English)

0 references

0 references

0 references

0 references

23 May 2016

0 references

zbMATH Keywords

symmetric linear complementarity problem

0 references

infeasible interior-point methods

0 references

Euclidean Jordan algebras

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1080/02331934.2013.869877

0 references

cites work

Extension of primal-dual interior point algorithms to symmetric cones

0 references

Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup>

0 references

A class of linear complementarity problems solvable in polynomial time

0 references

Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm

0 references

Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones

0 references

A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem

0 references

Feasibility issues in a primal-dual interior-point method for linear programming

0 references

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

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

0 references

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

0 references

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

0 references

A new full-Newton step $O(n)$ infeasible interior-point algorithm for semidefinite optimization

0 references

A full-Newton step $O(n)$ infeasible-interior-point algorithm for linear complementarity problems

0 references

An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization

0 references

A Jordan-algebraic approach to potential-reduction algorithms

0 references

Full Nesterov-Todd step infeasible interior-point method for symmetric optimization

0 references

A generalization of the linear complementarity problem

0 references

Identifiers

zbMATH Open document ID

1337.90083

0 references

DOI

10.1080/02331934.2013.869877

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2808306

@@ Property / cites work @@
+Extension of primal-dual interior point algorithms to symmetric cones
+Normal rank
@@ Property / cites work @@
+Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
+Normal rank
@@ Property / cites work @@
+Euclidean Jordan algebras and interior-point algorithms
+Normal rank
@@ Property / cites work @@
+Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+A class of linear complementarity problems solvable in polynomial time
+Normal rank
@@ Property / cites work @@
+Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
+Normal rank
@@ Property / cites work @@
+Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
+Normal rank
@@ Property / cites work @@
+A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Feasibility issues in a primal-dual interior-point method for linear programming
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
+Normal rank
@@ Property / cites work @@
+A Jordan-algebraic approach to potential-reduction algorithms
+Normal rank
@@ Property / cites work @@
+Similarity and other spectral relations for symmetric cones
+Normal rank
@@ Property / cites work @@
+Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
+Normal rank
@@ Property / cites work @@
+A generalization of the linear complementarity problem
+Normal rank