Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
From MaRDI portal
Publication:6495777
DOI10.1137/22M1531257MaRDI QIDQ6495777
Publication date: 2 May 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
polynomial optimizationweighted geometric meansemidefinite representationsecond-order cone representationminimum mediated set
Cites Work
- Unnamed Item
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Free semidefinite representation of matrix power functions
- Initial steps in the classification of maximal mediated sets
- Forms derived from the arithmetic-geometric inequality
- Second-order cone programming
- Semidefinite approximations of the matrix logarithm
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- A note on mediated simplices
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Minimal conic quadratic reformulations and an optimization model
- On \(p\)-norm linear discrimination
- On the semidefinite representation of real functions applied to symmetric matrices
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Lectures on Modern Convex Optimization
- Inequalities for M-matrices
- A Lower Bound on the Positive Semidefinite Rank of Convex Bodies
- Lifting for Simplicity: Concise Descriptions of Convex Sets
- A second order cone characterization for sums of nonnegative circuits
- Lifts of Convex Sets and Cone Factorizations
This page was built for publication: Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
