Abstract
Two results on the second-order-cone complementarity problem are presented. We show that the squared smoothing function is strongly semismooth. Under monotonicity and strict feasibility we provide a new proof, based on a penalized natural complementarity function, for the solution set of the second-order-cone complementarity problem being bounded. Numerical results of squared smoothing Newton algorithms are reported.
Original language | English |
---|---|
Pages (from-to) | 39-56 |
Number of pages | 18 |
Journal | Computational Optimization and Applications |
Volume | 25 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 1 Apr 2003 |
Externally published | Yes |
Keywords
- Complementarity function
- Quadratic convergence
- Smoothing Newton method
- Soc
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Applied Mathematics