
The authors propose a non-monotone smoothing-type algorithm for solving second-order cone programs. This algorithm is based on a non-monotone line search technique, introduced by \textit{H. Zhang} and \textit{W. W. Hager} [SIAM J. Optim. 14, No. 4, 1043--1056 (2004; Zbl 1073.90024)]. Its convergence is proven by using the theory of Euclidean Jordan algebras. Numerical experiments are also provided.
non-monotone line search, global convergence, Convex programming, Numerical mathematical programming methods, Nonlinear programming, Jordan structures associated with other structures, second-order cone programming, local quadratic convergence, smoothing Newton algorithm
non-monotone line search, global convergence, Convex programming, Numerical mathematical programming methods, Nonlinear programming, Jordan structures associated with other structures, second-order cone programming, local quadratic convergence, smoothing Newton algorithm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
