On \(\ell_ p\) programming
From MaRDI portal
Publication:1065711
DOI10.1016/0377-2217(85)90116-XzbMath0577.90062OpenAlexW2024509716MaRDI QIDQ1065711
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90116-x
duality theoremsoptimal solutionLagrange functionmultiple criteria programming\(\ell_ p\)-programminggeometrical inequality
Convex programming (90C25) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Mathematical programming (90C99)
Related Items
A Polynomial Method of Weighted Centers for Convex Quadratic Programming, On conic QPCCs, conic QCQPs and completely positive programs, A new algorithm for quadratic programming, Controlled dual perturbations for l p -programming, Polyhedral approximations inp-order cone programming, Inverse barriers and CES-functions in linear programming, Set intersection theorems and existence of optimal solutions, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, Some generalizations of the criss-cross method for quadratic programming, A note on the complexity of \(L _{p }\) minimization, A Frank-Wolfe type theorem for nondegenerate polynomial programs, Unnamed Item, On a Frank-Wolfe type theorem in cubic optimization, Solution existence and stability of quadratically constrained convex quadratic programs, The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves, Conic formulation for \(l_p\)-norm optimization, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, Linearly constrained estimation by mathematical programming, Smoothing empirical functions by \(\ell _ p\) programming, Risk optimization with \(p\)-order conic constraints: a linear programming approach, A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Improving complexity of structured convex optimization problems using self-concordant barriers, Matrix Perturbation and Optimal Partition Invariancy in Linear Optimization
Cites Work
- Compromise solutions, domination structures, and Salukvadze's solution
- Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
- Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
