A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
From MaRDI portal
Publication:4698792
DOI10.1137/S036301299223619XzbMATH Open0833.90109OpenAlexW2070890393MaRDI QIDQ4698792FDOQ4698792
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
Recommendations
Cited In (39)
- Parametric proximal-point methods
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A pathsearch damped Newton method for computing general equilibria
- A Parametric Newton Method for Optimization Problems in Hilbert Spaces
- A globally convergent inexact successive approximation method for nonlinear complementarity problems
- A new hybrid method for nonlinear complementarity problems
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems
- A new smoothing technique for mathematical programs with equilibrium constraints
- On the successive approximations method: Global convergence and plus- global convergence
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- Solving Two-Stage Stochastic Variational Inequalities by a Hybrid Projection Semismooth Newton Algorithm
- A fixed-point method for a class of super-large scale nonlinear complementarity problems
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
- Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- Inexact Newton methods for solving nonsmooth equations
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- A new trust region method for nonsmooth equations
- A smoothing Newton method for semi-infinite programming
- An entropic regularization approach for mathematical programs with equilibrium constraints
- Newton-type methods for quasidifferentiable equations
- Historical developments in convergence analysis for Newton's and Newton-like methods
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- Generalized Newton-iterative method for semismooth equations
- Inexact damped Newton method for nonlinear complementarity problems
- A perturbed version of an inexact generalized Newton method for solving nonsmooth equations
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- A verification method for solutions of nonsmooth equations
- Implicit smoothing and its application to optimization with piecewise smooth equality constraints
- Recursive approximation of the high dimensional max function
- Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
- Parametric method for global optimization
- Smoothing methods for nonsmooth, nonconvex minimization
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A kind of stochastic eigenvalue complementarity problems
- A quasisecant method for solving a system of nonsmooth equations
This page was built for publication: A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698792)
