Pages that link to "Item:Q3707783"
From MaRDI portal
The following pages link to Simple computable bounds for solutions of linear complementarity problems and linear programs (Q3707783):
Displayed 14 items.
- Error bounds for the linear complementarity problem with a P-matrix (Q922962) (← links)
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs (Q1058992) (← links)
- Bounds for the solution set of linear complementarity problems (Q1087474) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- Error bounds for inequality systems defining convex sets (Q2230941) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- Simple bounds for solutions of monotone complementarity problems and convex programs (Q3683929) (← links)
- On sensitivity analysis for multicriteria optimization (Q3796983) (← links)
- Error bounds for monotone linear complementarity problems (Q4721881) (← links)
- The numerical range theory and boundedness of solutions of the complementarity problem (Q5893789) (← links)
- The numerical range theory and boundedness of solutions of the complementarity problem (Q5895386) (← links)