Approximate Newton methods for nonsmooth equations
From MaRDI portal
Publication:1379958
DOI10.1023/A:1022606224224zbMath0899.90150MaRDI QIDQ1379958
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
superlinear convergence; semismooth equations; approximate Newton methods; consistently approximated Jacobian; Lipschitz continuous equations
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49J52: Nonsmooth analysis
65H10: Numerical computation of solutions to systems of equations
Related Items
Point-Based Set-Valued Approximations, C -Differential Operators and Applications, Solving variational inequality problems via smoothing-nonsmooth reformulations, Adaptive smoothing method, deterministically computable generalized Jacobians, and the Newton method
Cites Work
- Unnamed Item
- Unnamed Item
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Nondifferential optimization via adaptive smoothing
- Local convergence of quasi-Newton methods for B-differentiable equations
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- A nonsmooth Newton method for variational inequalities. I: Theory
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- Inexact Newton methods for solving nonsmooth equations
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- A nonsmooth version of Newton's method
- Nonsmooth Equations: Motivation and Algorithms
- Newton's Method for B-Differentiable Equations
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
