Multi-grid methods for Hamilton-Jacobi-Bellman equations
Numerische Mathematik
Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems
SIAM Journal on Control and Optimization
Newton's method for B-differentiable equations
Mathematics of Operations Research
Newton's method for the nonlinear complementarity problem: a B-differentiable equation problem
Mathematical Programming: Series A and B
A nonsmooth version of Newton's method
Mathematical Programming: Series A and B
Convergence analysis of some algorithms for solving nonsmooth equations
Mathematics of Operations Research
Growth behavior of a class of merit functions for the nonlinear complementarity problem
Journal of Optimization Theory and Applications
A class of smoothing functions for nonlinear and mixed complementarity problems
Computational Optimization and Applications
A semismooth equation approach to the solution of nonlinear complementarity problems
Mathematical Programming: Series A and B
Error bounds in mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems
Computational Optimization and Applications
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
SIAM Journal on Control and Optimization
Existence and Limiting Behavior of Trajectories Associatedwith P0-equations
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Computational Optimization and Applications
Error bounds for R0-type and monotone nonlinear complementarity problems
Journal of Optimization Theory and Applications
SIAM Journal on Optimization
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
SIAM Journal on Optimization
First Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems
SIAM Journal on Control and Optimization
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Mathematical Programming: Series A and B
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Mathematical Programming: Series A and B
Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications (Nonconvex Optimization and Its Applications)
A generalized Jacobian based Newton method for semismooth block-triangular system of equations
Journal of Computational and Applied Mathematics
Perturbation Bounds of P-Matrix Linear Complementarity Problems
SIAM Journal on Optimization
A new iterative method for discrete HJB equations
Numerische Mathematik
Global error bounds for the extended vertical LCP
Computational Optimization and Applications
SIAM Journal on Optimization
Hi-index | 0.00 |
Let f and g be continuously differentiable functions on R n . The nonlinear complementarity problem NCP(f,g), 0驴f(x)驴g(x)驴0, arises in many applications including discrete Hamilton-Jacobi-Bellman equations and nonsmooth Dirichlet problems. A popular method to find a solution of the NCP(f,g) is the generalized Newton method which solves an equivalent system of nonsmooth equations F(x)=0 derived by an NCP function. In this paper, we present a sufficient and necessary condition for F to be Fréchet differentiable, when F is defined by the "min" NCP function, the Fischer-Burmeister NCP function or the penalized Fischer-Burmeister NCP function. Moreover, we give an explicit formula of an element in the Clarke generalized Jacobian of F defined by the "min" NCP function, and the B-differential of F defined by other two NCP functions. The explicit formulas for generalized differentials of F lead to sharper global error bounds for the NCP(f,g).