Smoothing Newton algorithm based on a regularized one-parametric class of smoothing functions for generalized complementarity problems over symmetric cones

DOI10.3934/jimo.2010.6.363zbMath1220.90083OpenAlexW2012722797MaRDI QIDQ974724

Publication date: 7 June 2010

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2010.6.363

zbMATH Keywords

symmetric cone smoothing algorithm Euclidean Jordan algebra generalized complementarity problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (6)

Unified smoothing functions for absolute value equation associated with second-order cone ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems ⋮ Complementarity properties of the Lyapunov transformation over symmetric cones ⋮ Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem

Uses Software

SCCP

This page was built for publication: Smoothing Newton algorithm based on a regularized one-parametric class of smoothing functions for generalized complementarity problems over symmetric cones