A feasible semismooth asymptotically Newton method for mixed complementarity problems

From MaRDI portal
Publication:1396819

DOI10.1007/s10107-002-0305-2zbMath1023.90068OpenAlexW2067098824MaRDI QIDQ1396819

Robert S. Womersley, Defeng Sun, Hou-Duo Qi

Publication date: 13 July 2003

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

Full work available at URL: https://doi.org/10.1007/s10107-002-0305-2




Related Items (31)

A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problemsA generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restorationSmoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problemsA smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problemUnnamed ItemSmoothing proximal gradient method for general structured sparse regressionA modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensingA new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problemsPartial projected Newton method for a class of stochastic linear complementarity problemsA smoothing Newton method for solving a class of stochastic linear complementarity problemsTrust-region method for box-constrained semismooth equations and its applications to complementary problemsA modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rateA new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equationsSmoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problemsFeasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problemActive-set projected trust-region algorithm for box-constrained nonsmooth equationsAnalysis on Newton projection method for the split feasibility problemSolving equations via the trust region and its application to a class of stochastic linear complementarity problemsNew reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problemsA new smoothing Newton method for solving constrained nonlinear equationsSpectral gradient projection method for monotone nonlinear equations with convex constraintsSmoothing Newton method for NCP with the identification of degenerate indicesThe Lagrangian globalization method for nonsmooth constrained equationsImproved smoothing Newton methods for \(P_0\) nonlinear complementarity problemsA smoothing projected Newton-type algorithm for semi-infinite programmingFeasible semismooth Newton method for a class of stochastic linear complementarity problemsConvergence analysis of a projection algorithm for variational inequality problemsGlobally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equationsSelf-concordant inclusions: a unified framework for path-following generalized Newton-type algorithmsA smoothing approach for the optimal parameter selection problem with continuous inequality constraintAn active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations


Uses Software



This page was built for publication: A feasible semismooth asymptotically Newton method for mixed complementarity problems