Pages that link to "Item:Q753691"
From MaRDI portal
The following pages link to Error bounds for nondegenerate monotone linear complementarity problems (Q753691):
Displaying 33 items.
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone (Q382913) (← links)
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces (Q398639) (← links)
- Stability analysis of one stage stochastic mathematical programs with complementarity constraints (Q415375) (← links)
- Finite convergence of the proximal point algorithm for variational inequality problems (Q491230) (← links)
- Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
- Finite termination of the proximal point algorithm in Banach spaces (Q655479) (← links)
- On a global projection-type error bound for the linear complementarity problem (Q677141) (← links)
- A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions (Q721216) (← links)
- Global error bound for the generalized linear complementarity problem over a polyhedral cone (Q1035916) (← links)
- Finite termination of the proximal point algorithm (Q1176570) (← links)
- Global error bounds for monotone affine variational inequality problems (Q1195343) (← links)
- On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- New improved error bounds for the linear complementarity problem (Q1340062) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- A path-following interior-point algorithm for linear and quadratic problems (Q1915907) (← links)
- A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
- The solution set characterization and error bound for the extended mixed linear complementarity problem (Q1952792) (← links)
- Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
- Growth behavior of a class of merit functions for the nonlinear complementarity problem (Q2564173) (← links)
- Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints (Q2693648) (← links)
- Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms (Q2817234) (← links)
- On convergence of the proximal point algorithm in Banach spaces (Q3103282) (← links)
- Global error bounds for convex quadratic inequality systems<sup>*</sup> (Q4764592) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
- An improvement on the global error bound estimation for ELCP and its applications (Q5005291) (← links)
- Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming (Q5097021) (← links)
- Global error bound estimates algorithm for an \(R_0\)-type generalized LCP over polyhedral cone and its applications (Q6653534) (← links)