Globally convergent Jacobian smoothing inexact Newton methods for NCP
From MaRDI portal
Publication:1029625
DOI10.1007/s10589-007-9104-2zbMath1182.90091OpenAlexW2063978537MaRDI QIDQ1029625
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9104-2
Programming involving graphs or networks (90C35) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An inexact smoothing method for the monotone complementarity problem over symmetric cones, A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions, A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem, A smoothing inexact Newton method for generalized nonlinear complementarity problem, A smoothing inexact Newton method for variational inequality problems, A smoothing inexact Newton method for nonlinear complementarity problems, A nonmonotone line search method for noisy minimization, A nonmonotone Jacobian smoothing inexact Newton method for NCP, Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems, Jacobian smoothing Brown's method for NCP, Distributed real-time pricing method incorporating load uncertainty based on nonsmooth equations for smart grid, Inexact non-interior continuation method for solving large-scale monotone SDCP, Nonmonotone line search methods with variable sample size
Cites Work
- Unnamed Item
- Unnamed Item
- Inexact-Newton methods for semismooth systems of equations with block-angular structure
- Inexact trust region method for large sparse systems of nonlinear equations
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Inexact Newton methods for solving nonsmooth equations
- Numerical experience with Newton-like methods for nonlinear algebraic systems
- A nonsmooth version of Newton's method
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Local Convergence of Inexact Newton Methods
- Optimization and nonsmooth analysis
- Inexact Newton Methods
- Globally Convergent Inexact Newton Methods
- A special newton-type optimization method
- Smooth Approximations to Nonlinear Complementarity Problems
- Engineering and Economic Applications of Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Inexact semismooth Newton methods for large-scale complementarity problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Globally convergent inexact generalized Newton's methods for nonsmooth equations
- Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP