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
DOI10.1007/S13675-019-00116-6OpenAlexW2966970604WikidataQ127373717 ScholiaQ127373717MaRDI QIDQ2175368FDOQ2175368
Jean-Pierre Dussault, J. Ch. Gilbert, Mathieu Frappier
Publication date: 29 April 2020
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01806399/file/dussault-frappier-gilbert-2019-05-25.pdf
linear complementarity problemline searchsemismooth Newton methodglobalizationnondegenerate matrix\textbf{P}-matrixFathi and Murty problemsHarker and Pang algorithmiterative complexityNewton-min algorithm
Newton-type methods (49M15) 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?)
- 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
- A unified approach to interior point algorithms for linear complementary problems
- A nonsmooth version of Newton's method
- Trust Region Methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- The Linear Complementarity Problem
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Solution of symmetric linear complementarity problems by iterative methods
- Newton's Method for B-Differentiable Equations
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Newton-Type Methods for Optimization and Variational Problems
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A Partition Theorem for Euclidean n-Space
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Newton's method for linear complementarity problems
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- NP-completeness of the linear complementarity problem
- Computational complexity of complementary pivot methods
- Title not available (Why is that?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- 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
- On finite termination of an iterative method for linear complementarity problems
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- An algorithmic characterization of \(\mathbf P\)-matricity
- Complexity of a noninterior path-following method for the linear complementarity problem
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
Cited In (4)
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- 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
Uses Software
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175368)
