Conic formulation for l_p-norm optimization
From MaRDI portal
Publication:702372
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
Cites work
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- An extended conic formulation for geometric optimization
- Applications of second-order cone programming
- Convex Analysis
- Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
- Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
- On \(\ell_ p\) programming
- Proving strong duality for geometric optimization using a conic formulation
Cited in
(22)- Characterizations of boundary conditions on some non-symmetric cones
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- An extended conic formulation for geometric optimization
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
- A guide to conic optimisation and its applications
- The algebraic structure of the arbitrary-order cone
- Convex optimization and parsimony of \(L_p\)-balls representation
- scientific article; zbMATH DE number 1975312 (Why is no real title available?)
- 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
- \(L^{p}\)-norms, log-barriers and Cramer transform in optimization
- On \(p\)-norm linear discrimination
- 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
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)