Approximate Newton methods for nonsmooth equations
From MaRDI portal
Publication:1379958
DOI10.1023/A:1022606224224zbMATH Open0899.90150OpenAlexW1594115255MaRDI QIDQ1379958FDOQ1379958
Authors: J. Ning 
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022606224224
Recommendations
superlinear convergencesemismooth equationsapproximate Newton methodsconsistently approximated JacobianLipschitz continuous equations
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Newton's Method for B-Differentiable Equations
- Nondifferential optimization via adaptive smoothing
- Inexact Newton methods for solving nonsmooth equations
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Nonsmooth Equations: Motivation and Algorithms
- A nonsmooth Newton method for variational inequalities. I: Theory
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Local convergence of quasi-Newton methods for B-differentiable equations
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
Cited In (28)
- Convergence analysis of nonsmooth equations for the general nonlinear complementarity problem
- On a new class parametrized Newton-like method for semismooth equations
- Constructing a sequence of discrete Hessian matrices of an \(SC^{1}\) function uniformly convergent to the generalized Hessian matrix
- Multihomogeneous Newton methods
- Newton and Approximate Newton Methods in Combination with the Orthogonal Finite Integration Technique
- On the convergence of modified Newton methods for solving equations containing a non-differentiable term
- A Newton collocation method for solving dynamic bargaining games
- Computation of nonautonomous invariant and inertial manifolds
- A nonsmooth version of Newton's method
- Adaptive smoothing method, deterministically computable generalized Jacobians, and the Newton method
- Title not available (Why is that?)
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Point-Based Set-Valued Approximations, C -Differential Operators and Applications
- An approximate Newton method for non-smooth equations with finite max functions
- A system of nonsmooth equations solver based upon subgradient method
- Some quadrature-based versions of the generalized Newton method for solving nonsmooth equations
- Title not available (Why is that?)
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- A two-step SOR-Newton method for nonsmooth equations
- A numerical method for interface reconstruction of triple points within a volume tracking algorithm
- Some superlinearly convergent inexact generalized Newton method for solving nonsmooth equations
- An approximate Newton method for solving non-smooth equations with infinite max functions
- Convergence of the modified SOR-Newton method for non-smooth equations
- Title not available (Why is that?)
- Globally Convergent Newton Methods for Nonsmooth Equations
- Generalized Newton's method based on graphical derivatives
- Global convergence of the smoothing BFGS method for nonsmooth equations
- A generalized Jacobian based Newton method for semismooth block-triangular system of equations
This page was built for publication: Approximate Newton methods for nonsmooth equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379958)
