A modulus-based framework for weighted horizontal linear complementarity problems

DOI10.1016/J.AMC.2025.129313MaRDI QIDQ6993994zbMATH OpenFDO

Authors F. Mezzadri

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129313

zbMATH Keywords

matrix splitting methodsmodulus-based methodsnon-smooth Newton's methodweighted linear complementarity problem

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Positive matrices and their generalizations; cones of matrices (15B48) Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• \(H\)-splittings and two-stage iterative methods
• A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• A modulus-based formulation for the vertical linear complementarity problem
• A modulus-based matrix splitting method for the vertical nonlinear complementarity problem
• A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
• A nonmonotone smoothing Newton algorithm for weighted complementarity problem
• A nonsmooth version of Newton's method
• A smoothing Newton algorithm for weighted linear complementarity problem
• A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
• Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 3393631 (Why is no real title available?)
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• Modern nonconvex nondifferentiable optimization
• Modulus-based matrix splitting algorithms for the quasi-complementarity problems
• Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems.
• Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems
• Modulus-based matrix splitting methods for horizontal linear complementarity problems
• Modulus-based multisplitting iteration methods for a class of nonlinear complementarity problems
• Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
• Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
• Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems
• Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers
• On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Optimization and nonsmooth analysis
• Sufficient weighted complementarity problems
• Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
• The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
• The modulus-based nonsmooth Newton's method for solving a class of nonlinear complementarity problems of \(P\)-matrices
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• The relaxed nonlinear PHSS-like iteration method for absolute value equations
• The solvability of weighted complementarity problems and a smoothing Newton algorithm under the local error bound
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
• Weighted complementarity problems -- A new paradigm for computing equilibria

Cited in

(1)

• Fractional absolute value equations

This page was built for publication: A modulus-based framework for weighted horizontal linear complementarity problems

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