A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming

DOI10.1137/070685683zbMath1169.65057OpenAlexW2057795645MaRDI QIDQ3629526

Shaohua Pan, Jein-Shan Chen

Publication date: 27 May 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b80f2548767e397dbe6a301e88b468b23de8caf3

zbMATH Keywords

global convergencenumerical resultsproximal methodcone programmingsecond-order conemeasure of distanceinterior proximal-like algorithmssecond-order cone-convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (4)

Monotonicity and circular cone monotonicity associated with circular cones ⋮ SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ Some characterizations for SOC-monotone and SOC-convex functions

This page was built for publication: A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming