On \(\ell_ p\) programming

From MaRDI portal
Publication:1065711


DOI10.1016/0377-2217(85)90116-XzbMath0577.90062MaRDI QIDQ1065711

Tamás Terlaky

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

duality theorems; optimal solution; Lagrange function; multiple criteria programming; \(\ell_ p\)-programming; geometrical inequality


Mathematics Subject Classification ID

90C25: Convex programming

90C20: Quadratic programming

90C31: Sensitivity, stability, parametric optimization

90C99: Mathematical programming


Related Items

Some generalizations of the criss-cross method for quadratic programming, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Conic formulation for \(l_p\)-norm optimization, Set intersection theorems and existence of optimal solutions, A new algorithm for quadratic programming, Linearly constrained estimation by mathematical programming, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Inverse barriers and CES-functions in linear programming, A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications, Smoothing empirical functions by \(\ell _ p\) programming, Improving complexity of structured convex optimization problems using self-concordant barriers, The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Controlled dual perturbations for l p -programming, A Polynomial Method of Weighted Centers for Convex Quadratic Programming



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1065711&oldid=13089081"
Powered by MediaWiki