A globally convergent inexact smoothing algorithm for second-order cone programming

MaRDI QIDQ4927506zbMATH OpenFDO

Authors Jie Zhang, Shaoping Rui

Publication date 20 June 2013

zbMATH Keywords

global convergenceinexact Newton methodlarge-scale problemssecond-order cone programming

Mathematics Subject Classification ID

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

Recommendations

• An inexact smoothing algorithm for solving second-order cone programming problems
• Convergence of a semi-smooth inexact method for second-order cone programming
• An inexact smoothing algorithm for linear second-order cone complementarity problems
• A smoothing Newton method for solving the second-order cone programming
• Sub-quadratic convergence of a smoothing Newton method for second-order cone programming

Cited in

(6)

• Analysis of smoothing-type algorithms for the convex second-order cone programming
• 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 5670658 (Why is no real title available?)
• An inexact smoothing algorithm for solving second-order cone programming problems
• Convergence of a semi-smooth inexact method for second-order cone programming

This page was built for publication: A globally convergent inexact smoothing algorithm for second-order cone programming

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