Mathematics of Operations Research
A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
Journal of Computational and Applied Mathematics
A smoothing projected Newton-type algorithm for semi-infinite programming
Computational Optimization and Applications
Journal of Global Optimization
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
SIAM Journal on Optimization
Computational Optimization and Applications
Hi-index | 0.00 |
We show that a locally Lipschitz homeomorphism function is semismooth at a given point if and only if its inverse function is semismooth at its image point. We present a sufficient condition for the semismoothness of solutions to generalized equations over cone reducible (nonpolyhedral) convex sets. We prove that the semismoothness of solutions to the Moreau-Yosida regularization of a lower semicontinuous proper convex function is implied by the semismoothness of the metric projector over the epigraph of the convex function.