36 search results - page 5 / 8 » ol 2008 |
118
click to vote
OL
2007
14 years 11 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
OL
2007
14 years 11 months ago
2007
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
OL
2010
14 years 10 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
OL
2010
14 years 10 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
104
click to vote
OL
2010
14 years 10 months ago
2010
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...