An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393)

scientific article

Language	Label	Description	Also known as
English	An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones	scientific article

Statements

instance of

scholarly article

0 references

title

An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (English)

0 references

zbMATH Open document ID

1392.90114

0 references

DOI

10.1080/02331934.2016.1267732

0 references

0 references

0 references

0 references

0 references

30 March 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

infeasible interior point method

0 references

$P_\ast(\kappa)$ horizontal linear complementarity problem

0 references

Euclidean Jordan algebra

0 references

Cartesian product of symmetric cones

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2016.1267732

0 references

OpenAlex ID

W2561720919

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

Barrier Functions in Interior Point Methods

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

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

0 references

A unified approach to interior point algorithms for linear complementary problems

0 references

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

0 references

On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems

0 references

EP theorem for dual linear complementarity problems

0 references

A polynomial path-following interior point algorithm for general linear complementarity problems

0 references

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

0 references

Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path

0 references

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity

0 references

A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

0 references

A superquadratic infeasible-interior-point method for linear complementarity problems

0 references

On homogeneous and self-dual algorithms for LCP

0 references

On quadratic and $O(\sqrt{n}L)$ convergence of a predictor-corrector algorithm for LCP

0 references

Path-following interior point algorithms for the Cartesian $P_{*}(\kappa )$-LCP over symmetric cones

0 references

Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions

0 references

Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones

0 references

A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS

0 references

A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones

0 references

A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization

0 references

On theP*(κ)horizontal linear complementarity problems over Cartesian product of 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

A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems

0 references

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

0 references

A new primal-dual path-following method for convex quadratic programming

0 references

A polynomial interior-point algorithm for monotone linear complementarity problems

0 references

Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems

0 references

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

0 references

A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones

0 references

Linear systems in Jordan algebras and primal-dual interior-point algorithms

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

A Jordan-algebraic approach to potential-reduction algorithms

0 references

On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP

0 references

An infeasible interior-point algorithm with full-Newton steps for $P_*(\kappa)$ horizontal linear complementarity problems based on a kernel function

0 references

An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation

0 references

A path-following full Newton-step infeasible interior-point algorithm for $P_*(\kappa)$-HLCPs based on a kernel function

0 references

Complexity analysis of a full-{N}ewton step interior-point method for linear optimization

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2970393