Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. (Q489252)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. |
scientific article; zbMATH DE number 6391461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. |
scientific article; zbMATH DE number 6391461 |
Statements
Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. (English)
0 references
27 January 2015
0 references
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.
0 references
second-order cone programming
0 references
smoothing Newton algorithm
0 references
non-monotone line search
0 references
global convergence
0 references
local quadratic convergence
0 references
0 references
0 references
0 references
0 references
