Analysis of smoothing-type algorithms for the convex second-order cone programming

DOI10.1007/s12190-014-0797-yzbMath1323.90049OpenAlexW2042955552MaRDI QIDQ2346492

Hongqin Wang, Li Dong

Publication date: 2 June 2015

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-014-0797-y

zbMATH Keywords

convergencesmoothing algorithmEuclidean Jordan algebraconvex second-order cone programming

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A new smoothing Newton-type method for second-order cone programming problems
• Proximal-like algorithm using the quasi D-function for convex second-order cone programming
• A one-step smoothing Newton method for second-order cone programming
• Applications of second-order cone programming
• Second-order cone programming
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A one-parametric class of smoothing functions for second-order cone programming
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• A non-interior continuation method for second-order cone programming
• Optimization and nonsmooth analysis
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• A new non-interior continuation method for second-order cone programming

This page was built for publication: Analysis of smoothing-type algorithms for the convex second-order cone programming