Second-order cone programming

Known as: SOCP, Second order cone programming 
A second-order cone program (SOCP) is a convex optimization problem of the form minimize subject to where the problem parameters are , and . Here is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
05010019792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a… (More)
Is this relevant?
2013
2013
This paper describes a framework for generating easily verifiable code to solve convex optimization problems in embedded… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
This paper presents a generic method for solvingMarkov random fields (MRF) by formulating the problem of MAP estimation as 0-1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2006
2006
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the… (More)
  • figure 1
  • table II
  • figure 2
  • table III
  • table IV
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper we present optimization algorithms for image restoration based on the total variation (TV) minimization framework… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 15
  • figure 17
Is this relevant?
2004
2004
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We… (More)
  • figure 1
Is this relevant?
2002
2002
We study Friedlander's (1993) array interpolation technique, whose main shortcoming in multisource scenarios is that it does not… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems… (More)
Is this relevant?
1998
1998
Many nonlinear optimization problems can be cast as second-order cone programming problems. In this paper, we discuss a broad… (More)
Is this relevant?