A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems

Authors:
Jie Sun;Defeng Sun;Liqun Qi
Affiliations:
-;-;-
Venue:
SIAM Journal on Optimization
Year:
2003

Citing 0
Cited 7

A smoothing Newton method for a type of inverse semi-definite quadratic programming problem

Journal of Computational and Applied Mathematics
Smoothing algorithms for complementarity problems over symmetric cones

Computational Optimization and Applications
A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems

Computers & Mathematics with Applications
A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones

SIAM Journal on Optimization
A proximal point algorithm for the monotone second-order cone complementarity problem

Computational Optimization and Applications
Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs

SIAM Journal on Optimization
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a smoothing Newton method for solving a nonsmooth matrix equation that includes semidefinite programming and the semidefinite complementarity problem as special cases. This method, if specialized for solving semidefinite programs, needs to solve only one linear system per iteration and achieves quadratic convergence under strict complementarity and nondegeneracy. We also establish quadratic convergence of this method applied to the semidefinite complementarity problem under the assumption that the Jacobian of the problem is positive definite on the affine hull of the critical cone at the solution. These results are based on the strong semismoothness and complete characterization of the B-subdifferential of a corresponding squared smoothing matrix function, which are of general theoretical interest.