Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5926294
- Globally Convergent Newton Methods for Nonsmooth Equations
- A nonsmooth version of Newton's method
- Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms
- Newton methods for solving nonsmooth equations via a new subdifferential
Cited in
(only showing first 100 items - show all)- A smoothing projected Newton-type algorithm for semi-infinite programming
- A nonsmooth Newton's method for control-state constrained optimal control problems
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms
- On a semi-smooth Newton method and its globalization
- Globally convergent Jacobian smoothing inexact Newton methods for NCP
- One-step smoothing Newton method for solving the mixed complementarity problem with a \(P_{0}\) function
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
- Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization
- Inexact generalized Newton methods for second order C-differentiable optimization
- Inexact-Newton methods for semismooth systems of equations with block-angular structure
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- 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 elastoplastic problems
- Variable metric bundle methods: From conceptual to implementable forms
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- On piecewise quadratic Newton and trust region problems
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Parametrizations of Kojima's system and relations to penalty and barrier functions
- Sensitivity analysis of composite piecewise smooth equations
- A verification method for solutions of nonsmooth equations
- On superlinear convergence of quasi-Newton methods for nonsmooth equations
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Approximate Newton methods for nonsmooth equations
- New version of the Newton method for nonsmooth equations
- Newton methods for solving nonsmooth equations via a new subdifferential
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- An SQP-type method and its application in stochastic programs
- On the minimum norm solution of linear programs
- A modified secant method for semismooth equations
- Quasi-Newton trust region algorithm for non-smooth least squares problems
- Historical developments in convergence analysis for Newton's and Newton-like methods
- The theory of Newton's method
- Continuation method for nonlinear complementarity problems via normal maps
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- The relaxed nonlinear PHSS-like iteration method for absolute value equations
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- A kind of stochastic eigenvalue complementarity problems
- Further application of H-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions
- The vector-valued functions associated with circular cones
- Generalized Newton method for a kind of complementarity problem
- Numerical comparisons based on four smoothing functions for absolute value equation
- A Jacobian smoothing method for box constrained variational inequality problems
- Representation of the Clarke generalized Jacobian via the quasidifferential
- Differentiability and semismoothness properties of integral functions and their applications
- Newton methods for solving two classes of nonsmooth equations.
- Smoothing trust region methods for nonlinear complementarity problems with P₀-functions
- A smoothing Newton method for semi-infinite programming
- Convergence of a Ulm-like method for square inverse singular value problems with multiple and zero singular values
- An effective adaptive trust region algorithm for nonsmooth minimization
- A family of variable metric proximal methods
- A Newton method for a class of quasi-variational inequalities
- On finite termination of an iterative method for linear complementarity problems
- Algebraic univalence theorems for nonsmooth functions
- Global Newton-type methods and semismooth reformulations for NCP
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Newton's method for quadratic stochastic programs with recourse
- Inexact Newton methods for solving nonsmooth equations
- On bilevel programming. I: General nonlinear cases
- A parallel inexact Newton method for stochastic programs with recourse
- Generalized equations and the generalized Newton method
- A semismooth Newton method for nonlinear symmetric cone programming
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- A perturbed version of an inexact generalized Newton method for solving nonsmooth equations
- A Newton-type algorithm for solving problems of search theory
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Improved convergence results for an inexact smoothing method for the second-order cone complementarity problem
- Neural network based on systematically generated smoothing functions for absolute value equation
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- A smoothing quasi-Newton method for solving general second-order cone complementarity problems
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
- An innovative and efficient solution for axisymmetric contact problem between structure and half-space
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- B-subdifferential of the projection onto the generalized spectraplex
- Stochastic tensor complementarity problem with discrete distribution
- Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
- Scalable semismooth Newton methods with multilevel domain decomposition for subsurface flow and reactive transport in porous media
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
This page was built for publication: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697092)
