A variable-complexity norm maximization problem
SIAM Journal on Algebraic and Discrete Methods
Weak sharp minima in mathematical programming
SIAM Journal on Control and Optimization
Approximations to Solutions to Systems of Linear Inequalities
SIAM Journal on Matrix Analysis and Applications
Error bounds in mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
Journal of Global Optimization
| Hi-index | 0.00 |
Let E be a normed space, $$a_1^* ,...,a_m^* \in E^* ,c_1 ,...,c_m \in R$$ and $$S = \left\{ {x \in E\left| {\left\langle {a_i^* ,x} \right\rangle - c_i \leqslant 0,1 \leqslant i \leqslant m} \right.} \right\} \ne \emptyset $$ . Let $$\tau _* = \inf \left\{ {\tau \geqslant 0:dist\left( {x,S} \right) \leqslant \tau \max \left\{ {\left[ {\left\langle {a_i^* ,x} \right\rangle - c_i } \right]_ + :i = 1,...,m} \right\}\forall x \in E} \right\}$$ . We give some exact formulas for 7#x03C4;驴.