Pages that link to "Item:Q2926080"
From MaRDI portal
The following pages link to Polyhedral approximations in<i>p</i>-order cone programming (Q2926080):
Displayed 11 items.
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- The algebraic structure of the arbitrary-order cone (Q289064) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- A new class of very efficient algorithms for local dimming (Q724329) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures (Q3466784) (← links)
- Semidefinite Approximation of Closed Convex Set (Q4613906) (← links)