On the block-structured distance to non-surjectivity of sublinear mappings
From MaRDI portal
(Redirected from Publication:2487844)
Recommendations
- On a subclass of close-to-convex mappings
- Sublinear operators on block-type spaces
- Bounded distance preserving surjections in the geometry of matrices
- Block similarity invariants of restrictions to \((A,B)\)-invariant subspaces
- A characterization of the distance to infeasibility under block-structured perturbations
- Bounds for the distance to finite-dimensional subspaces
- Two notes on map preserving equality of distance and approximate surjective isometries
- Optimal realizations and the block decomposition of a finite metric space
- Sublinear mappings and metric regularity
- On the Distance of Subspaces of l p n to l p k
Cites work
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- A characterization of the distance to infeasibility under block-structured perturbations
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Condition measures and properties of the central trajectory of a linear program
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Convex Analysis
- Ill-Conditioned Matrices Are Componentwise Near to Singularity
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Ill-conditioned convex processes and conic linear systems.
- Ill-conditioned inclusions
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Linear programming, complexity theory and elementary functional analysis
- Norm duality for convex processes and applications
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
- Regularity and Stability for Convex Multivalued Functions
- Smooth Goodness-of-Fit Tests for the Baseline Hazard in Cox's Proportional Hazards Model
- Systems of linear interval equations
- The Componentwise Distance to the Nearest Singular Matrix
- The radius of metric regularity
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Variational Analysis
This page was built for publication: On the block-structured distance to non-surjectivity of sublinear mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487844)
