A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
From MaRDI portal
Publication:1736744
Recommendations
- A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions
- A smoothing Newton method for nonlinear complementarity problems
- A new smoothing method for solving nonlinear complementarity problems
- A nonmonotone smoothing Newton method for complementarity problems
- A new smoothing quasi-Newton method for nonlinear complementarity problems
Cites work
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A combined homotopy interior point method for the linear complementarity problem
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- A penalized Fischer-Burmeister NCP-function
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Conjugate gradient methods with Armijo-type line searches.
- Engineering and Economic Applications of Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Merit functions for complementarity and related problems: a survey
- New limited memory bundle method for large-scale nonsmooth optimization
- Optimization and nonsmooth analysis
- Smooth Approximations to Nonlinear Complementarity Problems
- Smoothing method for minimax problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
Cited in
(9)- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- The smoothing conjugate gradient method for a kind of generalized polynomial complementarity problem
- Modified Jacobian smoothing method for nonsmooth complementarity problems
- A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions
- A smoothing augmented Lagrangian method for nonconvex, nonsmooth constrained programs and its applications to bilevel problems
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- A smoothing and scaling Fletcher-Reeves type conjugate gradient method for systems of nonsmooth equations
- An inexact semismooth Newton SAA-based algorithm for stochastic nonsmooth SOC complementarity problems with application to a stochastic power flow programming problem
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
This page was built for publication: A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736744)
