The following pages link to On \(\ell_ p\) programming (Q1065711):
Displayed 15 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
- Set intersection theorems and existence of optimal solutions (Q879966) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
- A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (Q1576348) (← links)
- Smoothing empirical functions by \(\ell _ p\) programming (Q1819885) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves (Q2480973) (← links)
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
- Controlled dual perturbations for l p -programming (Q3734177) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)