A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP (Q4646542)

scientific article; zbMATH DE number 7001095

Language	Label	Description	Also known as
English	A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP	scientific article; zbMATH DE number 7001095

Statements

instance of

scholarly article

0 references

title

A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP (English)

0 references

published in

Optimization

0 references

publication date

14 January 2019

0 references

zbMATH Keywords

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.2018.1512604

0 references

cites work

Q4324980

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

Barrier Functions in Interior Point Methods

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

0 references

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

0 references

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

0 references

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

0 references

A Jordan-algebraic approach to potential-reduction algorithms

0 references

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

0 references

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

0 references

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

0 references

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

0 references

Primal-dual interior-point algorithm for convex quadratic semi-definite optimization

0 references

Q4003375

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

Equivaence between different formulations of the linear complementarity promblem

0 references

An infeasible-interior-point predictor-corrector algorithm for the $P_ *$-geometric LCP

0 references

$P_ *$-matrices are just sufficient

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

On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

Q4791754

0 references

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

0 references

Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems

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

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 Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization

0 references

Q4321748

0 references

Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

0 references

A method for weighted projections to the positive definite cone

0 references

Extension of primal-dual interior point methods to diff-convex problems on symmetric cones

0 references

Corrector-predictor methods for sufficient linear complementarity problems

0 references

Identifiers

zbMATH Open document ID

1416.90049

0 references

DOI

10.1080/02331934.2018.1512604

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4646542

A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542)

Statements

Identifiers

Sitelinks

Mathematics(1 entry)