Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations
DOI10.1016/j.cam.2005.03.045zbMath1080.90073OpenAlexW1983691524MaRDI QIDQ2576210
Publication date: 27 December 2005
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.2005.03.045
global convergencesuperlinear convergencesemismooth equationinexact generalized Newton methodaffine scaling interior
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On NCP-functions
- Nonmonotonic trust region algorithm
- On concepts of directional differentiability
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- A nonsmooth version of Newton's method
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- Nonsmooth Equations: Motivation and Algorithms
- Inexact Newton Methods
- Newton’s Method with a Model Trust Region Modification
- Quasi-Newton Methods, Motivation and Theory
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally Convergent Inexact Newton Methods
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
This page was built for publication: Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations