A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
From MaRDI portal
Publication:4698792
DOI10.1137/S036301299223619XzbMath0833.90109OpenAlexW2070890393MaRDI QIDQ4698792
Publication date: 11 May 1995
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s036301299223619x
Related Items (37)
A parameterized Newton method and a quasi-Newton method for nonsmooth equations ⋮ A pathsearch damped Newton method for computing general equilibria ⋮ A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints ⋮ An entropic regularization approach for mathematical programs with equilibrium constraints ⋮ Inexact damped Newton method for nonlinear complementarity problems ⋮ A fixed-point method for a class of super-large scale nonlinear complementarity problems ⋮ Inexact Newton methods for solving nonsmooth equations ⋮ Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations ⋮ A verification method for solutions of nonsmooth equations ⋮ Parametric method for global optimization ⋮ Solving Two-Stage Stochastic Variational Inequalities by a Hybrid Projection Semismooth Newton Algorithm ⋮ A perturbed version of an inexact generalized Newton method for solving nonsmooth equations ⋮ Generalized Newton-iterative method for semismooth equations ⋮ A kind of stochastic eigenvalue complementarity problems ⋮ A new smoothing technique for mathematical programs with equilibrium constraints ⋮ Global convergence of a filter-trust-region algorithm for solving nonsmooth equations ⋮ Parametric proximal-point methods ⋮ Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ Newton-type methods for quasidifferentiable equations ⋮ Implicit smoothing and its application to optimization with piecewise smooth equality constraints ⋮ Smoothing functions and smoothing Newton method for complementarity and variational inequality problems ⋮ Solving variational inequality problems via smoothing-nonsmooth reformulations ⋮ Recursive approximation of the high dimensional max function ⋮ A new hybrid method for nonlinear complementarity problems ⋮ Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming ⋮ Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions ⋮ A Parametric Newton Method for Optimization Problems in Hilbert Spaces ⋮ A smoothing Newton method for semi-infinite programming ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems ⋮ A primal-dual algorithm for minimizing a sum of Euclidean norms ⋮ A new trust region method for nonsmooth equations ⋮ Improving the convergence of non-interior point algorithms for nonlinear complementarity problems ⋮ Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem ⋮ Historical developments in convergence analysis for Newton's and Newton-like methods ⋮ Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems
This page was built for publication: A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
