On minimal extended representations of generalized power cones
From MaRDI portal
Publication:6622743
DOI10.1137/23m1617205MaRDI QIDQ6622743
Víctor Blanco, Miguel Martínez-Antón
Publication date: 22 October 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
combinatorial optimizationconic programmingsecond order conesextended representations\(p\)-order conesmediated graphspower conesweighted geometric optimization
Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Continuous multifacility ordered median location problems
- Continuous space maximal coverage: insights, advances and challenges
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Initial steps in the classification of maximal mediated sets
- Simple extensions of polytopes
- Differential properties of Euclidean projection onto power cone
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- Forms derived from the arithmetic-geometric inequality
- Applications of second-order cone programming
- Geometric programming technique to optimize power distribution system
- Polyhedral approximation in mixed-integer convex optimization
- A note on mediated simplices
- On self-concordant barriers for generalized power cones
- Optimal arrangements of hyperplanes for SVM-based multiclass classification
- Minimal conic quadratic reformulations and an optimization model
- The decompositions with respect to two core non-symmetric cones
- On \(p\)-norm linear discrimination
- Ordered \(p\)-median problems with neighbourhoods
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Lectures on Modern Convex Optimization
- Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Polyhedral approximations inp-order cone programming
- Positivitatsbereiche Im R n
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- On $\ell_p$-Support Vector Machines and Multidimensional Kernels
- Nonnegative Polynomials and Circuit Polynomials
- A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
- The Location of Emergency Service Facilities
- On Polyhedral Approximations of the Second-Order Cone
- Fairness in maximal covering location problems
- Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
This page was built for publication: On minimal extended representations of generalized power cones