Conic formulation for \(l_p\)-norm optimization

DOI10.1023/B:JOTA.0000042522.65261.51zbMath1092.90060OpenAlexW2035396114MaRDI QIDQ702372

François Glineur, Tamás Terlaky

Publication date: 17 January 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jota.0000042522.65261.51

zbMATH Keywords

interior-point methodsconic optimizationself-concordant barrier\(l_p\)-norm optimizationDuality theory

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Programming in abstract spaces (90C48)

Related Items (14)

The algebraic structure of the arbitrary-order cone ⋮ Polyhedral approximations inp-order cone programming ⋮ Alfonso: Matlab Package for Nonsymmetric Conic Optimization ⋮ The \(H\)-differentiability and calmness of circular cone functions ⋮ The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems ⋮ Unnamed Item ⋮ A guide to conic optimisation and its applications ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ An interior-point method for the single-facility location problem with mixed norms using a conic formulation ⋮ A modified LM algorithm for tensor complementarity problems over the circular cone ⋮ The decompositions with respect to two core non-symmetric cones ⋮ Risk optimization with \(p\)-order conic constraints: a linear programming approach ⋮ Characterizations of Boundary Conditions on Some Non-Symmetric Cones ⋮ On \(p\)-norm linear discrimination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\ell_ p\) programming
• Applications of second-order cone programming
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
• Convex Analysis
• Proving strong duality for geometric optimization using a conic formulation

This page was built for publication: Conic formulation for \(l_p\)-norm optimization