On the block-structured distance to non-surjectivity of sublinear mappings
From MaRDI portal
Publication:2487844
DOI10.1007/S10107-004-0514-YzbMATH Open1125.90068OpenAlexW2058658637MaRDI QIDQ2487844FDOQ2487844
Authors: Javier Peña 
Publication date: 8 August 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0514-y
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
Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Variational Analysis
- Convex Analysis
- Title not available (Why is that?)
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Systems of linear interval equations
- Regularity and Stability for Convex Multivalued Functions
- Smooth Goodness-of-Fit Tests for the Baseline Hazard in Cox's Proportional Hazards Model
- The radius of metric regularity
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Ill-Conditioned Matrices Are Componentwise Near to Singularity
- Condition measures and properties of the central trajectory of a linear program
- Linear programming, complexity theory and elementary functional analysis
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- A characterization of the distance to infeasibility under block-structured perturbations
- Ill-conditioned convex processes and conic linear systems.
- The Componentwise Distance to the Nearest Singular Matrix
- Ill-conditioned inclusions
- Norm duality for convex processes and applications
- On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
Cited In (2)
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)
