Desingularizing Functions in Convex Programming and Convergence of an Abstract Gradient Descent Algorithm
This paper introduces an approach to study what is called the canonical conditioner μf, the continuity, Lipschitz continuity, differentiability, and subdifferentiability properties of μf\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}