A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
Newton's method for B-differentiable equations
Mathematics of Operations Research
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
Algorithms for complementarity problems and generalized equations
Algorithms for complementarity problems and generalized equations
Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
Journal of Optimization Theory and Applications
On finite termination of an iterative method for linear complementarity problems
Mathematical Programming: Series A and B
A semismooth equation approach to the solution of nonlinear complementarity problems
Mathematical Programming: Series A and B
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
Mathematical Programming: Series A and B
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
SIAM Journal on Optimization
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Computational Optimization and Applications
Hybrid Newton-type method for a class of semismooth equations
Journal of Optimization Theory and Applications
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems
Computational Optimization and Applications
Merit Functions for Complementarity and Related Problems: A Survey
Computational Optimization and Applications
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications
On Two Applications of H-Differentiability to Optimization and Complementarity Problems
Computational Optimization and Applications
A Strongly Semismooth Integral Function and Its Application
Computational Optimization and Applications
Global Newton-type methods and semismooth reformulations for NCP
Applied Numerical Mathematics
Computational Optimization and Applications
Computational Optimization and Applications
Optimization Methods & Software
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
Optimization Methods & Software
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
A one-parametric class of merit functions for the second-order cone complementarity problem
Computational Optimization and Applications
Numerical comparisons of two effective methods for mixed complementarity problems
Journal of Computational and Applied Mathematics
A non-interior continuation algorithm for the CP based on a generalized smoothing function
Journal of Computational and Applied Mathematics
A nonsmooth algorithm for cone-constrained eigenvalue problems
Computational Optimization and Applications
A new class of penalized NCP-functions and its properties
Computational Optimization and Applications
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P0-function
Journal of Global Optimization
Computation of generalized differentials in nonlinear complementarity problems
Computational Optimization and Applications
Computational Optimization and Applications
Stationary point conditions for the FB merit function associated with symmetric cones
Operations Research Letters
Numerical methods for linear complementarity problems in physics-based animation
ACM SIGGRAPH 2013 Courses
A new method for solving Pareto eigenvalue complementarity problems
Computational Optimization and Applications
On regularity conditions for complementarity problems
Computational Optimization and Applications
Hi-index | 0.00 |
We introduce a new, one-parametric class of NCP-functions. This classsubsumes the Fischer function and reduces to the minimum functionin a limiting case of the parameter. This new class of NCP-functionsis used in order to reformulate the nonlinear complementarity problemas a nonsmooth system of equations. We present a detailed investigationof the properties of the equation operator, of the corresponding meritfunction as well as of a suitable semismooth Newton-type method.Finally, numerical results are presented for this methodbeing applied to a number of test problems.