A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
From MaRDI portal
Publication:979319
DOI10.1016/j.amc.2010.03.058zbMath1194.65080OpenAlexW2097693318MaRDI QIDQ979319
Publication date: 25 June 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.058
global convergencenumerical resultssuperlinear convergencenonlinear complementarity problemssmoothing-type algorithmnon-monotone line search
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A regularized smoothing Newton-type algorithm for quasi-variational inequalities ⋮ Nonmonotone smoothing inexact Newton method for the nonlinear complementarity problem ⋮ A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities ⋮ A new smoothing and regularization Newton method for the symmetric cone complementarity problem ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ A smoothing inexact Newton method for generalized nonlinear complementarity problem ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. ⋮ Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP ⋮ A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS ⋮ A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems ⋮ A matrix-free smoothing algorithm for large-scale support vector machines ⋮ A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search ⋮ A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP ⋮ A new smoothing-type algorithm for nonlinear weighted complementarity problem ⋮ A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP ⋮ Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines ⋮ Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function ⋮ A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A smoothing-type algorithm for solving system of inequalities
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- A revised cut-peak function method for box constrained continuous global optimization
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- A QP-free constrained Newton-type method for variational inequality problems
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- On Smoothing Methods for the P0 Matrix Linear Complementarity Problem
- A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
- Regularization of P0-Functions in Box Variational Inequality Problems
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- Weak Univalence and Connectedness of Inverse Images of Continuous Functions
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Engineering and Economic Applications of Complementarity Problems
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.