Pages that link to "Item:Q4835420"
From MaRDI portal
The following pages link to Approximations to Solutions to Systems of Linear Inequalities (Q4835420):
Displaying 20 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces (Q927945) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- Error bounds for inequality systems defining convex sets (Q2230941) (← links)
- Hoffman's least error bounds for systems of linear inequalities (Q2574102) (← links)
- Towards a deeper geometric, analytic and algorithmic understanding of margins (Q2815511) (← links)
- Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces (Q4687244) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- An easily computable upper bound on the Hoffman constant for homogeneous inequality systems (Q6179881) (← links)
