second-order cone programming

349 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Convex Models of Distribution System Reconfiguration (2012, methodology): “SOCP [10] is a polynomial-time generalization of convex QCP, which is solved using highly efficient interior point algorithms [24].”
Robust twin support vector machine for pattern classification (2013, background): “Now suppose the computational complexity is no more than Oðr3logðe 1ÞÞ [37], where e is parameters corresponding to a specific algorithm, and r denotes the number of variables.”
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty (2012, unknown): “2 this formulation is reduced to a deterministic convex optimization problem, more precisely, a Second-Order Cone Program (SOCP) [12, 27]; an efficient computational implementation is discussed in Section 2.”
Computation (2020, unknown): “However, at a general level, there is no method that integrates the different types of risks, even though it is necessary to have indicators of health and safety management through comprehensive risk assessments; therefore, this paper proposes a model to integrate this risk by applying the grey…”
A survey of numerical methods for nonlinear semidefinite programming (2015, background): “The linear SDP problems include linear programming problems, convex quadratic programming problems and second-order cone programming problems [1] as special cases.”