An inexact smoothing algorithm for solving second-order cone programming problems

MaRDI QIDQ4926574zbMATH OpenFDO

Authors Taoyan Yu, Xiao-Na Cai, F. Zhang, Sanyang Liu

Publication date 20 June 2013

zbMATH Keywords

inexact smoothing algorithmlocal quadratic convergencesecond-order cone programming problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• A globally convergent inexact smoothing algorithm for second-order cone programming
• scientific article; zbMATH DE number 6718896
• An inexact smoothing algorithm for linear second-order cone complementarity problems
• A smoothing Newton method for solving the second-order cone programming
• A new smoothing Newton-type method for second-order cone programming problems

Cited in

(9)

• Analysis of smoothing-type algorithms for the convex second-order cone programming
• Some theoretical limitations of second-order algorithms for smooth constrained optimization
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• An inexact smoothing algorithm for linear second-order cone complementarity problems
• scientific article; zbMATH DE number 6613528 (Why is no real title available?)
• scientific article; zbMATH DE number 5670658 (Why is no real title available?)
• A globally convergent inexact smoothing algorithm for second-order cone programming
• A Barzilai-Borwein gradient algorithm for second-order conic programming
• Convergence of a semi-smooth inexact method for second-order cone programming

This page was built for publication: An inexact smoothing algorithm for solving second-order cone programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926574)