On \(p\)-norm linear discrimination

DOI10.1016/j.ejor.2013.06.053zbMath1317.90230OpenAlexW2016505313MaRDI QIDQ2356201

Yana Morenko, Alexander Vinel, Zhaohan Yu, Pavlo A. Krokhmal

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.053

zbMATH Keywords

second order cone programminglinear separation\(p\)-order cone programming

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (9)

Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures ⋮ Polyhedral approximations inp-order cone programming ⋮ On risk-averse maximum weighted subgraph problems ⋮ Two-stage international portfolio models with higher moment risk measures ⋮ On valid inequalities for mixed integer \(p\)-order cone programming ⋮ Insurance with multiple insurers: a game-theoretic approach ⋮ A new class of very efficient algorithms for local dimming ⋮ Minimal conic quadratic reformulations and an optimization model

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Supervised classification and mathematical optimization
• Conic formulation for \(l_p\)-norm optimization
• Semidefinite representation of convex sets
• Risk optimization with \(p\)-order conic constraints: a linear programming approach
• Second-order cone programming
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Knowledge based proximal support vector machines
• Robust classification and regression using support vector machines
• Linear matrix inequality representation of sets
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Towards non-symmetric conic optimization
• On Polyhedral Approximations of the Second-Order Cone

This page was built for publication: On \(p\)-norm linear discrimination