A new one-step smoothing Newton method for second-order cone programming. (Q713481): Difference between revisions
From MaRDI portal
Latest revision as of 20:16, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new one-step smoothing Newton method for second-order cone programming. |
scientific article |
Statements
A new one-step smoothing Newton method for second-order cone programming. (English)
0 references
29 October 2012
0 references
The paper deals with the second-order cone programming (SOCP) problem. The authors present a one-step smoothing Newton method for solving the SOCP problem based on a new smoothing function of the Fischer-Burmeister function. The algorithm solves only one system of linear equations and performs only one Armijo-type line-search per iteration. Global and local quadratic convergence under standard assumptions are proved. Numerical experiments demonstrate efficiency of the algorithm.
0 references
Fischer-Burmeister function
0 references
Euclidean Jordan algebra
0 references
smoothing Newton method
0 references
global convergence
0 references
local quadratic convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
