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.363zbMATH Open1220.90083OpenAlexW2012722797MaRDI QIDQ974724FDOQ974724

Authors: Xiaohong Liu, Wei-Zhe Gu 

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

Recommendations

• Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
• A smoothing Newton method for symmetric cone complementarity problem
• A regularized smoothing Newton method for solving the symmetric cone complementarity problem
• Smoothing algorithms for complementarity problems over symmetric cones
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems

zbMATH Keywords

smoothing algorithmEuclidean Jordan algebrasymmetric conegeneralized complementarity problem

Mathematics Subject Classification ID

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

Cited In (10)

• Unified smoothing functions for absolute value equation associated with second-order cone
• Smoothing algorithms for complementarity problems over symmetric cones
• A generalized smoothing Newton method for the symmetric cone complementarity problem
• Complementarity properties of the Lyapunov transformation over symmetric cones
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
• Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
• A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
• A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
• An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
• 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

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