Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
From MaRDI portal
(Redirected from Publication:715065)
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
Recommendations
- An algorithmic characterization of 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₀- and monotone LCP
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
Cites work
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Linear Complementarity Problem with a P-Matrix
- A Partition Theorem for Euclidean n-Space
- A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Bimatrix Equilibrium Points and Mathematical Programming
- Co-NP-completeness of some matrix classification problems
- Complementary pivot theory of mathematical programming
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence analysis of the SQP method for nonlinear mixed-constrained elliptic optimal control problems
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Inexact semismooth Newton methods for large-scale complementarity problems
- Newton's method for linear complementarity problems
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- On a semi-smooth Newton method and its globalization
- On complex eigenvalues of M and P matrices
- On finite termination of an iterative method for linear complementarity problems
- Optimization and nonsmooth analysis
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- Solution of symmetric linear complementarity problems by iterative methods
- The Linear Complementarity Problem
- The P-matrix problem is co-NP-complete
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions
- Trust Region Methods
Cited in
(22)- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems
- Convergence analysis of semi-smooth Newton method for mixed FEM approximations of dynamic two-body contact and crack problems
- 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
- An algorithmic characterization of P-matricity
- On the B-differential of the componentwise minimum of two affine vector functions
- A unified framework for high-order numerical discretizations of variational inequalities
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- 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
- An overview of absolute value equations: from theory to solution methods and challenges
- Polyhedral Newton-min algorithms for complementarity problems
- 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
- A feasible active set method for strictly convex quadratic problems with simple bounds
- 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- 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
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)
