Conic formulation for l_p-norm optimization

DOI10.1023/B:JOTA.0000042522.65261.51zbMATH Open1092.90060OpenAlexW2035396114MaRDI QIDQ702372FDOQ702372

Authors: 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

Recommendations

scientific article; zbMATH DE number 1975312
An Efficient Algorithm for Minimizing a Sum of p-Norms
An extended conic formulation for geometric optimization
An interior-point method for the single-facility location problem with mixed norms using a conic formulation
Notes on Duality in Second Order and p -Order Cone Optimization

zbMATH Keywords

interior-point methods self-concordant barrier conic optimization $l_p$-norm optimization Duality theory

Mathematics Subject Classification ID

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

Cites Work

Convex Analysis
Title not available (Why is that?)
Applications of second-order cone programming
An Efficient Algorithm for Minimizing a Sum of p-Norms
Title not available (Why is that?)
On $\ell_ p$ programming
An extended conic formulation for geometric optimization
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)
Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
Proving strong duality for geometric optimization using a conic formulation

Cited In (22)

Alfonso: Matlab Package for Nonsymmetric Conic Optimization
Two pairs of families of polyhedral norms versus $\ell _p$-norms: proximity and applications in optimization
An extended conic formulation for geometric optimization
A guide to conic optimisation and its applications
The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
Convex optimization and parsimony of $L_p$-balls representation
The algebraic structure of the arbitrary-order cone
Title not available (Why is that?)
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
A homogeneous predictor-corrector algorithm for stochastic nonsymmetric convex conic optimization with discrete support
Polyhedral approximations in $p$-order cone programming
Risk optimization with $p$-order conic constraints: a linear programming approach
A modified LM algorithm for tensor complementarity problems over the circular cone
On $p$-norm linear discrimination
$L^{p}$-norms, log-barriers and Cramer transform in optimization
The $H$-differentiability and calmness of circular cone functions
Notes on Duality in Second Order and p -Order Cone Optimization
An interior-point method for the single-facility location problem with mixed norms using a conic formulation
Characterizations of solution sets of cone-constrained convex programming problems
The decompositions with respect to two core non-symmetric cones
Characterizations of boundary conditions on some non-symmetric cones
An Efficient Algorithm for Minimizing a Sum of p-Norms

This page was built for publication: Conic formulation for $l_p$-norm optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702372)