A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
From MaRDI portal
Publication:4518162
DOI10.1137/S1052623497324047zbMath0955.90136OpenAlexW2023092664MaRDI QIDQ4518162
Publication date: 20 November 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497324047
Numerical optimization and variational techniques (65K10) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An application of anisotropic regularization to the existence of weak Pareto minimal points ⋮ A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems ⋮ A regularized smoothing Newton-type algorithm for quasi-variational inequalities ⋮ Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems ⋮ A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities ⋮ A regularized smoothing-type algorithm for solving a system of inequalities with a \(P_{0}\)-function ⋮ A filter method for solving nonlinear complementarity problems based on derivative-free line search ⋮ 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 ⋮ Solving unbounded box constrained variational inequalities via a homotopy method ⋮ A new filter method for solving nonlinear complementarity problems ⋮ A regularization smoothing method for second-order cone complementarity problem ⋮ A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems ⋮ A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem ⋮ Homotopy method for solving ball-constrained variational inequalities ⋮ Solvability of Newton equations in smoothing-type algorithms for the SOCCP ⋮ Solvability of monotone tensor complementarity problems ⋮ The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem ⋮ Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation ⋮ An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions ⋮ A smoothing Newton method for solving a class of stochastic linear complementarity problems ⋮ A smoothing inexact Newton method for variational inequality problems ⋮ A smoothing-type algorithm for solving system of inequalities ⋮ 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 ⋮ A nonlinear complementarity approach to multiuser power control for digital subscriber lines ⋮ 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. ⋮ The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Extension of smoothing Newton algorithms to solve linear programming over symmetric cones ⋮ A new hybrid method for nonlinear complementarity problems ⋮ Analysis on Newton projection method for the split feasibility problem ⋮ A new smoothing and regularization Newton method for \(P_{0}\)-NCP ⋮ Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions ⋮ 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 ⋮ Smooth convex approximation to the maximum eigenvalue function ⋮ A matrix-free smoothing algorithm for large-scale support vector machines ⋮ A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors ⋮ Convergence of a non-interior smoothing method for variational inequality problems ⋮ Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems ⋮ A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function ⋮ Convergence analysis of a projection algorithm for variational inequality problems ⋮ 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 smoothing conic trust region filter method for the nonlinear complementarity problem ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ 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 ⋮ Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP ⋮ The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
