Results 1  10
of
1,120
Limit Analysis with the Dual Affine Scaling Algorithm
 J. Comput. Appl. Math
, 1995
"... The collapse state of a rigid plastic material with the linearized Mises yield condition is computed. We use an infeasible point variant of the dual affine scaling algorithm for linear programming which is extremely efficient for this large sparse and ill conditioned problem. For a classical test pr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The collapse state of a rigid plastic material with the linearized Mises yield condition is computed. We use an infeasible point variant of the dual affine scaling algorithm for linear programming which is extremely efficient for this large sparse and ill conditioned problem. For a classical test
Superlinear PrimalDual Affine Scaling Algorithms for LCP
 Mathematics of Operations Research
, 1993
"... We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown to ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown
Superlinear primaldual affine scaling algorithms for LCP
, 1993
"... We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown to ..."
Abstract
 Add to MetaCart
We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown
PrimalDual AffineScaling Algorithms Fail For Semidefinite Programming
, 1998
"... In this paper, we give an example of a semidefinite programming problem in which primaldual affinescaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a nonoptimal solution, and that, for the AHO directio ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we give an example of a semidefinite programming problem in which primaldual affinescaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a nonoptimal solution, and that, for the AHO
Polynomiality of PrimalDual Affine Scaling Algorithms for Nonlinear Complementarity Problems
, 1995
"... This paper provides an analysis of the polynomiality of primaldual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
to mappings that are not monotone. We show that a family of primaldual affine scaling algorithms generates an approximate solution (given a precision ffl) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial of n, ln(1=ffl) and a condition number
An Implementation Of The Dual Affine Scaling Algorithm For Minimum Cost Flow On Bipartite Uncapacitated Networks
 SIAM Journal on Optimization
, 1993
"... . We describe an implementation of the dual affine scaling algorithm for linear programming specialized to solve minimum cost flow problems on bipartite uncapacitated networks. This implementation uses a preconditioned conjugate gradient algorithm to solve the system of linear equations that determi ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
. We describe an implementation of the dual affine scaling algorithm for linear programming specialized to solve minimum cost flow problems on bipartite uncapacitated networks. This implementation uses a preconditioned conjugate gradient algorithm to solve the system of linear equations
A PolynomialTime PrimalDual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and its Power Series Extension
 MATHEMATICS OF OPERATIONS RESEARCH
, 1990
"... We describe an algorithm for linear and convex quadratic programming problems that uses power series approximation of the weighted barrier path that passes through the current iterate in order to find the next iterate. If r 1 is the order of approximation used, we show that our algorithm has time c ..."
Abstract

Cited by 56 (5 self)
 Add to MetaCart
complexity O i n 1 2 (1+ 1 r ) L (1+ 1 r ) j iterations and O(n 3 + n 2 r) arithmetic operations per iteration, where n is the dimension of the problem and L is the size of the input data. When r = 1, we show that the algorithm can be interpreted as an affine scaling algorithm in the primaldual
An affine invariant interest point detector
 In Proceedings of the 7th European Conference on Computer Vision
, 2002
"... Abstract. This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such transformations introduce significant changes in the point location as well as in the scale and the shape of ..."
Abstract

Cited by 1467 (55 self)
 Add to MetaCart
by local extrema of normalized derivatives over scale. 3) An affineadapted Harris detector determines the location of interest points. A multiscale version of this detector is used for initialization. An iterative algorithm then modifies location, scale and neighbourhood of each point and converges
Distinctive Image Features from ScaleInvariant Keypoints
, 2003
"... This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substa ..."
Abstract

Cited by 8955 (21 self)
 Add to MetaCart
This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1016 (35 self)
 Add to MetaCart
sirable properties: the set is closed under 1. continuous (and thus projective) transformation of image coordinates and 2. monotonic transformation of image intensities. An efficient (near linear complexity) and practically fast detection algorithm (near frame rate) is presented for an affinelyinvariant stable
Results 1  10
of
1,120