✦ LIBER ✦

AVU-decomposition method for a second-order cone programming problem

✍ Scribed by Yuan Lu; Li-ping Pang; Zun-quan Xia

Publisher: Springer
Year: 2010
Tongue: English
Weight: 159 KB
Volume: 31
Category: Article
ISSN: 0253-4827
DOI: 10.1007/s10483-010-0214-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Second-Order Cone Programming Method f

A Second-Order Cone Programming Method for Multiuser Detection Problem

✍ Xuewen Mu; Yaling Zhang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 291 KB

A smoothing method for second order cone

A smoothing method for second order cone complementarity problem

✍ Xiangsong Zhang; Sanyang Liu; Zhenhua Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 532 KB

In this paper, the second order cone complementarity problem is studied. Based on a perturbed symmetrically smoothing function, which has coerciveness under proper conditions, we present a smoothing Newton method for this problem. The boundedness of the level set can be obtained from the coercivenes

A one-step smoothing Newton method for s

A one-step smoothing Newton method for second-order cone programming

✍ Xiaoni Chi; Sanyang Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 500 KB

A new smoothing function for the second-order cone programming is given by smoothing the symmetric perturbed Fischer-Burmeister function. Based on this new function, a one-step smoothing Newton method is presented for solving the second-order cone programming. The proposed algorithm solves only one

A regularization smoothing method for se

A regularization smoothing method for second-order cone complementarity problem

✍ Xiangsong Zhang; Sanyang Liu; Zhenhua Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 253 KB

In this paper, the second-order cone complementarity problem is studied. Based on the Fischer-Burmeister function with a perturbed parameter, which is also called smoothing parameter, a regularization smoothing Newton method is presented for solving the sequence of regularized problems of the second

A second-order method for the general no

A second-order method for the general nonlinear programming problem

✍ H. Mukai; E. Polak 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 941 KB

A descent method for a reformulation of

A descent method for a reformulation of the second-order cone complementarity problem

✍ Jein-Shan Chen; Shaohua Pan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Analogous to the nonlinear complementarity problem and the semi-definite complementarity problem, a popular approach to solving the second-order cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over R n . In this paper, we present