A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
From MaRDI portal
Publication:492135
DOI10.1016/j.cam.2015.06.022zbMath1327.90335OpenAlexW767334234MaRDI QIDQ492135
Publication date: 19 August 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.06.022
global convergencenumerical resultssmoothing Broyden-like methodsuperlinear/quadratic convergencenonmonotoneNCP
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions ⋮ A modified multivariate spectral gradient projection method for nonlinear complementarity problems ⋮ A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI ⋮ A nonmonotone Jacobian smoothing inexact Newton method for NCP ⋮ A smoothing quasi-Newton method for solving general second-order cone complementarity problems ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- On convergence of a smoothing Broyden-like method for \(P_0\)-NCP
- Inexact trust region method for large sparse systems of nonlinear equations
- Error bounds in mathematical programming
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Global Newton-type methods and semismooth reformulations for NCP
- A Newton-type method for positive-semidefinite linear complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem
- Nonsmooth Equations: Motivation and Algorithms
- Semismooth and Semiconvex Functions in Constrained Optimization
- Smooth Approximations to Nonlinear Complementarity Problems
- Engineering and Economic Applications of Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Nonlinear Programs with Positively Bounded Jacobians
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
