The sublinear operator method and selector problems
The selector method was applied effectively to the investigation of sublinear operators; the inverse method that arises in this investigation (it is natural to call it the sublinear operator method) was used successfully for reinforcing one of Michael's theorems on continuous selectors and for inverting Michael's theorems on continuous selectors. However, until now, these methods were always connected closely with a particular kind of selectors (continuous, affine, or semilinear selectors). In this paper, I suggest a general scheme of presenting these methods for formulating and solving new problems on selectors with the help of subdifferential calculus; unlike the former schemes, this scheme does not depend on selectors that are used.
- scientific article; zbMATH DE number 3944552
- A subgradient selection method for minimizing convex functions subject to linear constraints
- Approximation schemes for a class of subset selection problems
- LATIN 2004: Theoretical Informatics
- scientific article; zbMATH DE number 1336278
- Approximation by sublinear operators
- On Lagrangian Relaxation and Subset Selection Problems
- Subsampling algorithms for semidefinite programming
- scientific article; zbMATH DE number 4137537
- Approximation by multivariate sublinear and max-product operators
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- On the cone of bounded lower semicontinuous functions
- scientific article; zbMATH DE number 3944552 (Why is no real title available?)
- scientific article; zbMATH DE number 1225257 (Why is no real title available?)
- scientific article; zbMATH DE number 1734607 (Why is no real title available?)
This page was built for publication: The sublinear operator method and selector problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377957)
