A nonlinear Lagrangian method based on log-sigmoid function for nonconvex semidefinite programming (Q2379811)

The authors consider an optimization problem consisting of minimizing a twice continuously differentiable function subject to nonlinear semidefinite programming constraints, a generally difficult nonconvex problem. The authors are primarily interested in the theoretical convergence analysis of a particular Lagrangian method using the log-sigmoid function. There are no numerical experiments.