Polyhedral Newton-min algorithms for complementarity problems

From MaRDI portal

Jump to:navigation, search

DOI10.1007/S10107-025-02219-YMaRDI QIDQ6873501zbMATH OpenFDO

Authors Jean-Pierre Dussault, Mathieu Frappier, J. Ch. Gilbert

Publication date 16 January 2026

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

zbMATH Keywords

global convergence complementarity problem quadratic convergence linesearch minimum function semismooth Newton P-matrix least-squares merit function nonsmooth reformulation polyhedral Newton-min algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15) Numerical methods for variational inequalities and related problems (65K15)

This page was built for publication: Polyhedral Newton-min algorithms for complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873501)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Polyhedral_Newton-min_algorithms_for_complementarity_problems&oldid=75269932"