A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103)

scientific article

Language	Label	Description	Also known as
English	A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity	scientific article

Statements

instance of

scholarly article

0 references

title

A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (English)

0 references

zbMATH Open document ID

1383.90040

0 references

DOI

10.1080/02331934.2016.1231187

0 references

published in

Optimization

0 references

publication date

7 December 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

infeasible-interior-point method

0 references

wide neighborhood

0 references

linear complementarity problem

0 references

symmetric cone programming

0 references

$P_\ast(\kappa)$-property

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2016.1231187

0 references

OpenAlex ID

W2524253346

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

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

0 references

Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions

0 references

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

0 references

A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization

0 references

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

0 references

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

0 references

Neighborhood-following algorithms for linear programming

0 references

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

0 references

A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

0 references

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

0 references

A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming

0 references

A unified approach to interior point algorithms for linear complementary problems

0 references

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

0 references

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

0 references

A large-update interior-point method for Cartesian $P_{\ast}(\kappa)$-LCP over symmetric cones

0 references

Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones

0 references

A wide neighborhood interior-point method for Cartesian $P_*(\kappa )$-LCP over symmetric cones

0 references

Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP

0 references

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

0 references

Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2836103