A homogeneous model for monotone mixed horizontal linear complementarity problems

DOI10.1007/s10589-018-0035-xzbMath1417.90140OpenAlexW2894130071MaRDI QIDQ1734775

Cosmin G. Petra, Florian A. Potra

Publication date: 27 March 2019

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1491659

zbMATH Keywords

interior-point methodhomogenizationmixed horizontal LCP

Mathematics Subject Classification ID

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

Related Items

On well-structured convex–concave saddle point problems and variational inequalities with monotone operators

Uses Software

• HOPDM
• LIPSOL
• PCx
• OOQP
• iOptimize

Cites Work

• A new polynomial-time algorithm for linear programming
• A homogeneous model for mixed complementarity problems over symmetric cones
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• On interior algorithms for linear programming with no regularity assumptions
• A computational study of the homogeneous algorithm for large-scale convex optimization
• Reducing a monotone horizontal LCP to an LCP
• On homogeneous and self-dual algorithms for LCP
• On a homogeneous algorithm for the monotone complementarity problem
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
• On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Equivaence between different formulations of the linear complementarity promblem
• Properties of an Interior-Point Mapping for Mixed Complementarity Problems
• Generalized Linear Complementarity Problems
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• Object-oriented software for quadratic programming
• Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method