An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation

DOI10.1137/18M1168522OpenAlexW2786204129MaRDI QIDQ5232118

Gilbert, Jean Charles, I. Ben Gharbia

Publication date: 29 August 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1168522

zbMATH Keywords

linear complementarity problemP-matrixsemismooth Newton methodNewton-min algorithmNM-matrixP-matricity characterization

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15) Numerical analysis (65-XX)

Related Items

A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems, Exact computation of an error bound for the balanced linear complementarity problem with unique solution, A posteriori error estimates for a compositional two-phase flow with nonlinear complementarity constraints, Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
• Numerical optimization. Theoretical and practice aspects
• On finite termination of an iterative method for linear complementarity problems
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
• Gas phase appearance and disappearance as a problem with complementarity constraints
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
• A nonsmooth version of Newton's method
• A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems
• An Algorithmic Characterization of $P$-Matricity
• A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
• The Linear Complementarity Problem
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Primal-Dual Strategy for Constrained Optimal Control Problems
• Engineering and Economic Applications of Complementarity Problems
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
• Inexact semismooth Newton methods for large-scale complementarity problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Partition Theorem for Euclidean n-Space
• Numerical optimization. Theoretical and practical aspects. Transl. from the French