Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771): Difference between revisions

Latest revision as of 06:16, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones	scientific article

Statements

instance of

scholarly article

0 references

title

Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (English)

0 references

0 references

0 references

0 references

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

6 March 2019

0 references

zbMATH Keywords

horizontal linear complementarity problem

0 references

infeasible interior-point method

0 references

large neighborhood

0 references

Euclidean Jordan algebra (EJA)

0 references

Cartesian product of symmetric cones

0 references

describes a project that uses

DIMACS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-018-1402-6

0 references

cites work

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

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

0 references

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

0 references

Predictor-corrector algorithm for solving $P_ *(\kappa)$-matrix LCP from arbitrary positive starting points

0 references

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

0 references

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

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

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

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 Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones

0 references

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

0 references

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

0 references

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

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

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

0 references

Q4321748

0 references

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

0 references

Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones

0 references

Engineering and Economic Applications of Complementarity Problems

0 references

Equivalence of LCP and PLS

0 references

Identifiers

zbMATH Open document ID

1409.90198

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10957-018-1402-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1730771

@@ Property / DOI @@
-.1007/s10957-018-1402-6
@@ Property / DOI: 10.1007/s10957-018-1402-6 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10957-018-1402-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2896984205
@@ Property / OpenAlex ID: W2896984205 / rank @@
+Normal rank
@@ Property / cites work @@
+Barrier Functions in Interior Point Methods
@@ Property / cites work: Barrier Functions in Interior Point Methods / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Self-Scaled Cones
+Normal rank
@@ Property / cites work @@
+Euclidean Jordan algebras and interior-point algorithms
+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 @@
+On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
+Normal rank
@@ Property / cites work @@
+A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
+Normal rank
@@ Property / cites work @@
+Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+Extension of primal-dual interior point algorithms to symmetric cones
+Normal rank
@@ Property / cites work @@
+Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
+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 @@
+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
+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 Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
+Normal rank
@@ Property / cites work @@
+Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP
+Normal rank
@@ Property / cites work @@
+Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
+Normal rank
@@ Property / cites work @@
+Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+On the<i>P<sub>*</sub>(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones
+Normal rank
@@ Property / cites work @@
+An infeasible full-NT step IPM for  horizontal linear complementarity problem over Cartesian product of symmetric cones
+Normal rank
@@ Property / cites work @@
+Q4321748
@@ Property / cites work: Q4321748 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
+Normal rank
@@ Property / cites work @@
+Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
+Normal rank
@@ Property / cites work @@
+Engineering and Economic Applications of Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Equivalence of LCP and PLS
@@ Property / cites work: Equivalence of LCP and PLS / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129086396
@@ Property / Wikidata QID: Q129086396 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10957-018-1402-6
@@ Property / DOI: 10.1007/S10957-018-1402-6 / rank @@
+Normal rank