A smoothing projected Newton-type method for semismooth equations with bound constraints

DOI10.3934/JIMO.2005.1.235zbMath1177.90389OpenAlexW2331583526MaRDI QIDQ1780134

Xiaojiao Tong, S. Z. Zhou

Publication date: 7 June 2005

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2005.1.235

Mathematics Subject Classification ID

Nonlinear programming (90C30) 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 (10)

Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations ⋮ Smoothing SQP algorithm for semismooth equations with box constraints ⋮ A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration ⋮ A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate ⋮ Supermemory gradient methods for monotone nonlinear equations with convex constraints ⋮ Homotopy method for solving variational inequalities with bounded box constraints ⋮ A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset ⋮ Spectral gradient projection method for monotone nonlinear equations with convex constraints ⋮ A smoothing approach for the optimal parameter selection problem with continuous inequality constraint ⋮ Three derivative-free projection methods for nonlinear equations with convex constraints

This page was built for publication: A smoothing projected Newton-type method for semismooth equations with bound constraints