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

Revision as of 13:04, 18 August 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

DOI

10.1007/s10957-018-1402-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1730771

Revision as of 14:32, 18 July 2024 ReferenceBot (talk \| contribs) Bots 1,903,984 edits ‎Changed an Item ← Older edit	Revision as of 13:04, 18 August 2024 Daniel (talk \| contribs) Bureaucrats, Interface administrators, private, Suppressors, Administrators 619,709 edits ‎Created claim: Wikidata QID (P12): Q129086396, #quickstatements; #temporary_batch_1723982401803 Tag: QuickStatements [1.0.4] Newer edit →
	Property / Wikidata QID
		Q129086396
	Property / Wikidata QID: Q129086396 / rank
		Normal rank