Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations

DOI10.1002/nla.673zbMath1240.65168OpenAlexW2027314364MaRDI QIDQ3090786

Jinhai Chen, Liqun Qi

Publication date: 2 September 2011

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.673

zbMATH Keywords

nonsmooth analysisglobal convergencenumerical examplessystems of nonlinear equationsKrylov subspace methodsuperlinear convergenceinexact Newton methodnonmonotonic technique

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (4)

Unnamed Item ⋮ On lifting operators and regularity of nonsmooth Newton methods for optimal control problems of differential algebraic equations ⋮ Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem ⋮ Globalization technique for projected Newton–Krylov methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• Secant methods for semismooth equations
• Nonmonotonic trust region algorithm
• Nonsmooth equations in optimization. Regularity, calculus, methods and applications
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• Iterative solution of linear systems in the 20th century
• On concepts of directional differentiability
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
• A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
• Nonsmooth Equations: Motivation and Algorithms
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Inexact Newton Methods
• Globally Convergent Newton Methods for Nonsmooth Equations
• Globally Convergent Inexact Newton Methods
• A special newton-type optimization method
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
• Inexact semismooth Newton methods for large-scale complementarity problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Nonmonotone Line Search Technique for Newton’s Method
• A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection Methods
• Choosing the Forcing Terms in an Inexact Newton Method
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations

This page was built for publication: Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations