161 search results - page 4 / 33 » Methods for convex and general quadratic programming |
JGO
2011
14 years 6 months ago
2011
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
108
click to vote
OL
2007
14 years 10 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...
101
click to vote
SIAMJO
2010
14 years 9 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
102
click to vote
EUSFLAT
2009
14 years 8 months ago
2009
In this paper, line search based on Sequential Quadratic Programming is implemented in order to find a solution to Fuzzy Relation Equations. Sequential Quadratic Programming is a g...
110
click to vote
ICML
2006
IEEE
15 years 12 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...