Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
DOI10.1007/s40314-017-0485-2zbMath1429.90081OpenAlexW2736394370MaRDI QIDQ1993579
Xinyu Song, Li Dong, Jingyong Tang
Publication date: 5 November 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-017-0485-2
global convergencequadratic convergencesmoothing algorithmcomplementarity system over second-order cone
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Two classes of merit functions for the second-order cone complementarity problem
- A smoothing method for second order cone complementarity problem
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- A smoothing method with appropriate parameter control based on Fischer-Burmeister function for second-order cone complementarity problems
- A new method for solving second-order cone eigenvalue complementarity problems
- A nonsmooth version of Newton's method
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
This page was built for publication: Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
