Improving the convergence of non-interior point algorithms for nonlinear complementarity problems

DOI10.1090/S0025-5718-99-01082-0zbMath0947.90117OpenAlexW2012726395MaRDI QIDQ4700198

Liqun Qi, Defeng Sun

Publication date: 1 November 1999

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01082-0

zbMATH Keywords

algorithmnonlinear complementarity problemsuperlinear convergenceglobally convergent

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

A new non-interior continuation method for solving the second-order cone complementarity problem ⋮ A smoothing inexact Newton method for variational inequalities with nonlinear constraints ⋮ On sparse linear discriminant analysis algorithm for high-dimensional data classification ⋮ A smoothing Newton method for nonlinear complementarity problems ⋮ A smoothing Newton method for the second-order cone complementarity problem. ⋮ A predictor-corrector smoothing Newton method for symmetric cone complementarity problems ⋮ A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem ⋮ A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem ⋮ A note on quadratic convergence of a smoothing Newton algorithm for the LCP ⋮ 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. ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ A new non-interior continuation method for \(P_0\)-NCP based on a SSPM-function. ⋮ A smoothing Newton method for second-order cone optimization based on a new smoothing function ⋮ A smoothing Newton method for solving a class of stochastic linear complementarity problems ⋮ A smoothing inexact Newton method for nonlinear complementarity problems ⋮ Sub-quadratic convergence of a smoothing Newton method for second-order cone programming ⋮ Analysis of a non-interior continuation method for second-order cone programming ⋮ A one-step smoothing Newton method for second-order cone programming ⋮ A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties ⋮ Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. ⋮ A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function ⋮ Some non-interior path-following methods based on a scaled central path for linear complementarity problems ⋮ A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization ⋮ A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function ⋮ A new smoothing and regularization Newton method for \(P_{0}\)-NCP ⋮ A smoothing-type Newton method for second-order cone programming problems based on a new smooth function ⋮ A new one-step smoothing Newton method for second-order cone programming. ⋮ Complexity of a noninterior path-following method for the linear complementarity problem ⋮ A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems ⋮ The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem ⋮ Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems ⋮ A new smoothing Newton-type method for second-order cone programming problems ⋮ A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function ⋮ NON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITY ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem ⋮ A non-interior continuation method for second-order cone programming ⋮ Inexact non-interior continuation method for solving large-scale monotone SDCP ⋮ A smoothing least square method for nonlinear complementarity problem ⋮ A new homotopy method for solving non-linear complementarity problems ⋮ A new noninterior continuation method for solving a system of equalities and inequalities ⋮ A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings ⋮ Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A continuation method for (strongly) monotone variational inequalities
• A smoothing method for mathematical programs with equilibrium constraints
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• A continuation method for monotone variational inequalities
• Smoothing methods for convex inequalities and linear complementarity problems
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A nonsmooth version of Newton's method
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Optimization and nonsmooth analysis
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
• An Infeasible Path-Following Method for Monotone Complementarity Problems
• Smooth Approximations to Nonlinear Complementarity Problems
• Engineering and Economic Applications of Complementarity Problems
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
• Some Noninterior Continuation Methods for Linear Complementarity Problems

This page was built for publication: Improving the convergence of non-interior point algorithms for nonlinear complementarity problems