Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions
DOI10.1016/j.cam.2007.07.039zbMath1151.65047OpenAlexW2009018340MaRDI QIDQ935779
Publication date: 8 August 2008
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.2007.07.039
algorithmglobal convergencepreconditioningerror boundsinterior point methodsuperlinear convergenceLevenberg-Marquardt methodaffine scalingsemismooth equation
Numerical mathematical programming methods (65K05) 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations
- 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
- Newton's Method for B-Differentiable Equations
- Some continuity properties of polyhedral multifunctions
- 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