Results 1  10
of
22
A New GraphTheoretic Approach to Clustering, with Applications to Computer Vision
, 2004
"... This work applies cluster analysis as a unified approach for a wide range of vision applications, thereby combining the research domain of computer vision and that of machine learning. Cluster analysis is the formal study of algorithms and methods for recovering the inherent structure within a given ..."
Abstract

Cited by 62 (6 self)
 Add to MetaCart
This work applies cluster analysis as a unified approach for a wide range of vision applications, thereby combining the research domain of computer vision and that of machine learning. Cluster analysis is the formal study of algorithms and methods for recovering the inherent structure within a given dataset. Many problems of computer vision have precisely this goal, namely to find which visual entities belong to an inherent structure, e.g. in an image or in a database of images. For example, a meaningful structure in the context of image segmentation is a set of pixels which correspond to the same object in a scene. Clustering algorithms can be used to partition the pixels of an image into meaningful parts, which may correspond to different objects. In this work we focus on the problems of image segmentation and image database organization. The visual entities to consider are pixels and images, respectively. Our first contribution in this work is a novel partitional (flat) clustering algorithm. The algorithm uses pairwise representation, where the visual objects (pixels,
Global convergence of SSM for minimizing a quadratic over a sphere
 Math. Comp
, 2004
"... Abstract. In an earlier paper [Minimizing a quadratic over a sphere, SIAM J. Optim., 12 (2001), 188–208], we presented the sequential subspace method (SSM) for minimizing a quadratic over a sphere. This method generates approximations to a minimizer by carrying out the minimization over a sequence o ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract. In an earlier paper [Minimizing a quadratic over a sphere, SIAM J. Optim., 12 (2001), 188–208], we presented the sequential subspace method (SSM) for minimizing a quadratic over a sphere. This method generates approximations to a minimizer by carrying out the minimization over a sequence of subspaces that are adjusted after each iterate is computed. We showed in this earlier paper that when the subspace contains a vector obtained by applying one step of Newton’s method to the firstorder optimality system, SSM is locally, quadratically convergent, even when the original problem is degenerate with multiple solutions and with a singular Jacobian in the optimality system. In this paper, we prove (nonlocal) convergence of SSM to a global minimizer whenever each SSM subspace contains the following three vectors: (i) the current iterate, (ii) the gradient of the cost function evaluated at the current iterate, and (iii) an eigenvector associated with the smallest eigenvalue of the cost function Hessian. For nondegenerate problems, the convergence rate is at least linear when vectors (i)–(iii) are included in the SSM subspace. 1.
Constructing Test Functions for Global Optimization Using Continuous Formulations of Graph Problems
 Optimization Methods and Software
, 2005
"... A method for constructing test functions for global optimization which utilizes continuous formulations of combinatorial optimization problems is suggested. In particular, global optimization formulations for the maximum independent set, maximum clique and MAX CUT problems on arbitrary graphs are co ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
A method for constructing test functions for global optimization which utilizes continuous formulations of combinatorial optimization problems is suggested. In particular, global optimization formulations for the maximum independent set, maximum clique and MAX CUT problems on arbitrary graphs are considered, and proofs for some of them are given. A number of sample test functions based on these formulations are proposed.
Solving the quadratic trustregion subproblem in a lowmemory BFGS framework
 OPTIMIZATION METHODS AND SOFTWARE
, 2008
"... We present a new matrixfree method for the largescale trustregion subproblem, assuming that the approximate Hessian is updated by the LBFGS formula with m = 1 or 2. We determine via simple formulas the eigenvalues of these matrices and, at each iteration, we construct a positive definite matrix ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We present a new matrixfree method for the largescale trustregion subproblem, assuming that the approximate Hessian is updated by the LBFGS formula with m = 1 or 2. We determine via simple formulas the eigenvalues of these matrices and, at each iteration, we construct a positive definite matrix whose inverse can be expressed analytically, without using factorization. Consequently, a direction of negative curvature can be computed immediately by applying the inverse power method. The computation of the trial step is obtained by performing a sequence of inner products and vector summations. Furthermore, it immediately follows that the strong convergence properties of trust region methods are preserved. Numerical results are also presented.
Recent advances in graph partitioning
, 2013
"... We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
A Continuous Quadratic Programming Formulation of the Vertex Separator Problem
, 2013
"... The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets of roughly equal size. In a recent paper (Optimality Conditions For Maximizing a Function Over a Polyhedron, Mathematical Programming, 2013, doi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets of roughly equal size. In a recent paper (Optimality Conditions For Maximizing a Function Over a Polyhedron, Mathematical Programming, 2013, doi: 10.1007/s1010701306441), the authors announced a new continuous bilinear quadratic programming formulation of the VSP, and they used this quadratic programming problem to illustrate the new optimality conditions. The current paper develops conditions for the equivalence between this continuous quadratic program and the vertex separator problem, and it examines the relationship between the continuous formulation of the VSP and continuous quadratic programming formulations for both the edge separator problem and maximum clique problem.