Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
From MaRDI portal
Publication:715065
DOI10.1007/S10107-010-0439-6zbMATH Open1254.90252OpenAlexW2052611587MaRDI QIDQ715065FDOQ715065
Ibtihel Ben Gharbia, J. Ch. Gilbert
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0439-6
Recommendations
- An algorithmic characterization of \(\mathbf P\)-matricity
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- scientific article; zbMATH DE number 724220
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
linear complementarity problem\(M\)-matrixNewton's method\(P\)-matrixnonconvergencenonsmooth function
Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Inexact semismooth Newton methods for large-scale complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Optimization and nonsmooth analysis
- Trust Region Methods
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Complementary pivot theory of mathematical programming
- The Linear Complementarity Problem
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Bimatrix Equilibrium Points and Mathematical Programming
- Solution of symmetric linear complementarity problems by iterative methods
- A Linear Complementarity Problem with a P-Matrix
- On complex eigenvalues of M and P matrices
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Title not available (Why is that?)
- A Partition Theorem for Euclidean n-Space
- Newton's method for linear complementarity problems
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- Title not available (Why is that?)
- 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
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- The P-matrix problem is co-NP-complete
- On finite termination of an iterative method for linear complementarity problems
- On a semi-smooth Newton method and its globalization
- Co-NP-completeness of some matrix classification problems
- Convergence analysis of the SQP method for nonlinear mixed-constrained elliptic optimal control problems
- The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions
Cited In (17)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems
- Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
- A unified framework for high-order numerical discretizations of variational inequalities
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- Gas phase appearance and disappearance as a problem with complementarity constraints
- A posteriori error estimates for a compositional two-phase flow with nonlinear complementarity constraints
- Fully coupled generalized hybrid-mixed finite element approximation of two-phase two-component flow in porous media. I: Formulation and properties of the mathematical model
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Adaptive inexact smoothing Newton method for a nonconforming discretization of a variational inequality
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution
- Simultaneous enforcement of constraints at position and velocity levels in the nonsmooth generalized-\(\alpha\) scheme
- 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: Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715065)
