A smoothing Gauss-Newton method for the generalized HLCP

DOI10.1016/S0377-0427(00)00550-1zbMath0985.65070OpenAlexW2003962980WikidataQ127482091 ScholiaQ127482091MaRDI QIDQ5936078

Nai-Hua Xiu, Zhang, Jianzhong

Publication date: 2 July 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00550-1

zbMATH Keywords

quadratic convergencehorizontal linear complementarity problemsmoothing Gauss-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)

Related Items (14)

Parameter optimization in large-scale dynamical systems: A method of contractive mapping ⋮ A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems ⋮ A linear complementarity model for multibody systems with frictional unilateral and bilateral constraints ⋮ Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ A smoothing Levenberg-Marquardt method for the extended linear complementarity problem ⋮ A smoothing Newton method for semi-infinite programming ⋮ A self-adaptive trust region method for the extended linear complementarity problems ⋮ On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Reducing a monotone horizontal LCP to an LCP
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• On the extended linear complementarity problem
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• The Extended Linear Complementarity Problem
• Generalized Linear Complementarity Problems
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points
• An Analysis of Zero Set and Global Error Bound Properties of a Piecewise Affine Function via Its Recession Function
• A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
• A useful generalization of theP 0 matrix concept

This page was built for publication: A smoothing Gauss-Newton method for the generalized HLCP