Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP

DOI10.1007/s10107-003-0457-8zbMath1168.90646OpenAlexW2070031908MaRDI QIDQ1881042

Liqun Qi, Defeng Sun, Zheng-Hai Huang

Publication date: 27 September 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0457-8

zbMATH Keywords

global convergencelinear complementarity problemsmoothing Newton methodsub-quadratic convergence

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ An inexact smoothing method for the monotone complementarity problem over symmetric cones ⋮ A regularized smoothing Newton-type algorithm for quasi-variational inequalities ⋮ A smoothing Newton algorithm for weighted linear complementarity problem ⋮ The linear convergence of a derivative-free descent method for nonlinear complementarity problems ⋮ A fixed-point method for a class of super-large scale nonlinear complementarity problems ⋮ Smoothing Newton method for generalized complementarity problems based on a new smoothing function ⋮ A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ On the convergence of an inexact Newton-type method ⋮ A generalized Newton method for absolute value equations associated with second order cones ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ A full-Newton step non-interior continuation algorithm for a class of complementarity problems ⋮ A note on quadratic convergence of a smoothing Newton algorithm for the LCP ⋮ Solvability of Newton equations in smoothing-type algorithms for the SOCCP ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ Solvability of monotone tensor complementarity problems ⋮ Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. ⋮ The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities ⋮ A new class of penalized NCP-functions and its properties ⋮ An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions ⋮ A generalized Newton method for absolute value equations associated with circular cones ⋮ Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem ⋮ Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities ⋮ Sub-quadratic convergence of a smoothing Newton method for second-order cone programming ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function ⋮ A smoothing inexact Newton method for nonlinear complementarity problems ⋮ A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP ⋮ Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs ⋮ A new modified one-step smoothing Newton method for solving the general mixed complementarity problem ⋮ A smoothing Newton method for absolute value equation associated with second-order cone ⋮ A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search ⋮ Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Tensor complementarity problems. II: Solution methods ⋮ A matrix-free smoothing algorithm for large-scale support vector machines ⋮ A smoothing Levenberg-Marquardt method for NCP ⋮ Convergence of a non-interior smoothing method for variational inequality problems ⋮ A smoothing and regularization Broyden-like method for nonlinear inequalities ⋮ Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ A homotopy method for solving multilinear systems with strong completely positive tensors ⋮ Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems ⋮ A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution ⋮ A non-interior continuation method for second-order cone programming ⋮ Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems