Journal of Optimization Theory and Applications
Complexity of a noninterior path-following method for the linear complementarity problem
Journal of Optimization Theory and Applications
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications
Computational Optimization and Applications
Smoothing Method for Minimax Problems
Computational Optimization and Applications
Computational Optimization and Applications
Quadratic one-step smoothing Newton method for P0-LCP without strict complementarity
Applied Mathematics and Computation
Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization
Focus on computational neurobiology
Journal of Computational and Applied Mathematics
A one-step smoothing Newton method for second-order cone programming
Journal of Computational and Applied Mathematics
A variant smoothing Newton method for P0-NCP based on a new smoothing function
Journal of Computational and Applied Mathematics
A smoothing method for second order cone complementarity problem
Journal of Computational and Applied Mathematics
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
Optimization Methods & Software
A Globally Convergent Smoothing Method for Symmetric Conic Linear Programming
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
A smoothing inexact Newton method for nonlinear complementarity problems
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
A new smoothing and regularization Newton method for P0-NCP
Journal of Global Optimization
A non-interior continuation algorithm for the CP based on a generalized smoothing function
Journal of Computational and Applied Mathematics
A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
SIAM Journal on Optimization
Hi-index | 0.00 |
A noninterior continuation method is proposed for nonlinear complementarity problems. It improves the noninterior continuation methods recently studied by Burke and Xu [Math. Oper. Res., 23 (1998), pp. 719--734] and Xu [The Global Linear Convergence of an Infeasible Non-Interior Path-following Algorithm for Complementarity Problems with Uniform P-functions, Preprint, Department of Mathematics, University of Washington, Seattle, 1996]; the interior point neighborhood technique is extended to a broader class of smoothing functions introduced by Chen and Mangasarian [Comput. Optim. Appl., 5 (1996), pp. 97--138]. The method is shown to be globally linearly convergent following the methodology established by Burke and Xu. In addition, a local acceleration step is added to the method so that it is also locally quadratically convergent under suitable assumptions.