Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems

DOI10.1007/BF02614394zbMath0872.90102OpenAlexW1997671037MaRDI QIDQ1356056

Masao Fukushima, Nobuo Yamashita

Publication date: 4 June 1997

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

Full work available at URL: https://doi.org/10.1007/bf02614394

zbMATH Keywords

nonlinear complementaritymerit functionsNewton-typesemismooth reformulation of monotone complementarity problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (42)

Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations ⋮ Geometric views of the generalized fischer-burmeister function and its induced merit function ⋮ An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function ⋮ Implementation of a continuation method for normal maps ⋮ The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem ⋮ A derivative-free filter algorithm for nonlinear complementarity problem ⋮ A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions ⋮ A note on the spectral gradient projection method for nonlinear monotone equations with applications ⋮ On almost smooth functions and piecewise smooth functions ⋮ Smooth and nonsmooth analyses of vector-valued functions associated with circular cones ⋮ Merit functions for nonsmooth complementarity problems and related descent algorithms ⋮ The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ A new class of penalized NCP-functions and its properties ⋮ Discovery of new complementarity functions for NCP and SOCCP ⋮ A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function ⋮ Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations ⋮ Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. ⋮ Nonnegative inverse eigenvalue problems with partial eigendata ⋮ A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs ⋮ A projection method for a system of nonlinear monotone equations with convex constraints ⋮ Inverse and implicit function theorems forH-differentiable and semismooth functions ⋮ Inexact semismooth Newton methods for large-scale complementarity problems ⋮ A continuation method for linear complementarity problems withP₀matrix ⋮ Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem ⋮ Solving nonlinear complementarity problems with neural networks: A reformulation method approach ⋮ Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming ⋮ A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search ⋮ A smoothing Newton method for semi-infinite programming ⋮ Smoothing Newton method for NCP with the identification of degenerate indices ⋮ Symmetrization of generalized natural residual function for NCP ⋮ A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques ⋮ A smoothing Levenberg-Marquardt method for NCP ⋮ Lagrangian globalization methods for nonlinear complementarity problems ⋮ A family of NCP functions and a descent method for the nonlinear complementarity problem ⋮ Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints ⋮ New constrained optimization reformulation of complementarity problems ⋮ A modified Levenberg-Marquardt method for nonsmooth equations with finitely many maximum functions ⋮ Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones ⋮ A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Test examples for nonlinear programming codes
• Gauss-Newton methods for the complementarity problem
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• A semismooth equation approach to the solution of nonlinear complementarity problems
• On the resolution of monotone complementarity problems
• Nonlinear complementarity as unconstrained optimization
• A nonsmooth version of Newton's method
• On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
• Nonsmooth Equations: Motivation and Algorithms
• Optimization and nonsmooth analysis
• Strongly Regular Generalized Equations
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• A special newton-type optimization method
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Point-to-Set Maps in Mathematical Programming

This page was built for publication: Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems