An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
DOI10.1137/18M1168522OpenAlexW2786204129MaRDI QIDQ5232118FDOQ5232118
Authors: I. Ben Gharbia, J. Ch. Gilbert 
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
linear complementarity problemsemismooth Newton methodP-matrixNewton-min algorithmNM-matrixP-matricity characterization
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical analysis (65-XX) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Title not available (Why is that?)
- Inexact semismooth Newton methods for large-scale complementarity problems
- A nonsmooth version of Newton's method
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- The Linear Complementarity Problem
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Engineering and Economic Applications of Complementarity Problems
- Gas phase appearance and disappearance as a problem with complementarity constraints
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Title not available (Why is that?)
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A Partition Theorem for Euclidean n-Space
- A feasible active set method for strictly convex quadratic problems with simple bounds
- Title not available (Why is that?)
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- Title not available (Why is that?)
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Title not available (Why is that?)
- On finite termination of an iterative method for linear complementarity problems
- An algorithmic characterization of \(\mathbf P\)-matricity
- Numerical optimization. Theoretical and practice aspects
- 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
Cited In (5)
- 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
- 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
Uses Software
This page was built for publication: An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232118)
