55 search results - page 1 / 11 » A Feasible BFGS Interior Point Algorithm for Solving Convex ... |
SIAMJO
2000
13 years 4 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
JOTA
2011
12 years 12 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
MOR
2006
13 years 4 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...