A constructive approach to strengthen algebraic descriptions of function and operator classes
From MaRDI portal
Cites work
- Algorithms in real algebraic geometry
- An extension theorem for convex functions of class \(C^{1,1}\) on Hilbert spaces
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Convex analysis and monotone operator theory in Hilbert spaces
- Differentiable functions defined in closed sets. I.
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Exact worst-case performance of first-order methods for composite convex optimization
- Explicit formulas for \(C^{1,1}\) Glaeser-Whitney extensions of \(1\)-Taylor fields in Hilbert spaces
- Extension of convex function
- From error bounds to the complexity of first-order descent methods for convex functions
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2156771 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Interpolation conditions for linear operators and applications to performance estimation problems
- Interpolation of data by smooth nonnegative functions
- Lectures on convex optimization
- Minimal Lipschitz extensions to differentiable functions defined on a Hilbert space
- Multivariate convex regression with adaptive partitioning
- On the convergence of block coordinate descent type methods
- On the extension of a vector function so as to preserve a Lipschitz condition
- On the Matrix Equation X′X = A
- On the properties of convex functions over open sets
- On uniformly convex functions
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Optimal complexity and certification of Bregman first-order methods
- Orthogonal polynomials.
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
- Performance of first-order methods for smooth convex minimization: a novel approach
- Positive polynomials and sums of squares
- Smooth convex extensions of convex functions
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Über die Darstellung definiter Formen als Summe von Formenquadraten.
- Über die zusammenziehende und Lipschitzsche Transformationen.
- Universal gradient methods for convex optimization problems
- Whitney extension theorems for convex functions of the classes \(C^1\) and \(C^{1\omega}\)
This page was built for publication: A constructive approach to strengthen algebraic descriptions of function and operator classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309773)
