Pages that link to "Item:Q4697308"
From MaRDI portal
The following pages link to Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set (Q4697308):
Displaying 10 items.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Sufficient conditions for error bounds of difference functions and applications (Q727390) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Regularized method of linearization for minimizing a convex function on a polyhedral set with errors in the input data (Q1823146) (← links)
- On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- Error estimation in nonlinear optimization (Q2250085) (← links)
- The application of an oblique-projected Landweber method to a model of supervised learning (Q2473156) (← links)
