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
From MaRDI portal
Publication:2175368
Cites work
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- 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 complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A nonsmooth version of Newton's method
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A unified approach to interior point algorithms for linear complementary problems
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- An algorithmic characterization of \(\mathbf P\)-matricity
- Complexity of a noninterior path-following method for the linear complementarity problem
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Computational complexity of complementary pivot methods
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Inexact semismooth Newton methods for large-scale complementarity problems
- Minimization of functions having Lipschitz continuous first partial derivatives
- NP-completeness of the linear complementarity problem
- Newton's Method for B-Differentiable Equations
- Newton's method for linear complementarity problems
- Newton-Type Methods for Optimization and Variational Problems
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On finite termination of an iterative method for linear complementarity problems
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Solution of symmetric linear complementarity problems by iterative methods
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The Linear Complementarity Problem
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Trust Region Methods
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
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)
