Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem

DOI10.1007/S10107-025-02260-XMaRDI QIDQ7349076zbMATH OpenFDO

Authors Marianna Eisenberg-Nagy, Tibor Illés, Yuri Nesterov, Petra Renáta Rigó

Publication date 16 September 2026

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-025-02260-X

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites work

• \(P_ *\)-matrices are just sufficient
• A mathematical view of interior-point methods in convex optimization
• A path to the Arrow-Debreu competitive market equilibrium
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• scientific article; zbMATH DE number 4131946 (Why is no real title available?)
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 3557508 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 3253619 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Interior-point algorithms for a generalization of linear programming and weighted centring
• Introductory lectures on convex optimization. A basic course.
• Lectures on convex optimization
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices
• Nonlinear Programming
• Parabolic target space and primal-dual interior-point methods
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• Some generalizations of the criss-cross method for quadratic programming
• Sufficient matrices and the linear complementarity problem
• Sufficient weighted complementarity problems
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
• Unified approach of interior-point algorithms for P_* ()-LCPs using a new class of algebraically equivalent transformations
• Weighted complementarity problems -- A new paradigm for computing equilibria

This page was built for publication: Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349076)