Results 11  20
of
4,407
Convergence of an infeasible shortstep pathfollowing algorithm based on the GaussNewton direction
, 2000
"... This short note proves the polynomial time convergence of a short step, approximate path following, interiorpoint primaldual algorithm for semidenite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the rst proof of conve ..."
Abstract
 Add to MetaCart
This short note proves the polynomial time convergence of a short step, approximate path following, interiorpoint primaldual algorithm for semidenite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the rst proof
Complexity of pathfollowing methods for the . . .
"... A unitarily invariant projective framework is introduced to analyze the complexity of path–following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill–posedness, is given. A Newton map appropriate for this context is defined, and a version of Smale’s γ ..."
Abstract
 Add to MetaCart
A unitarily invariant projective framework is introduced to analyze the complexity of path–following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill–posedness, is given. A Newton map appropriate for this context is defined, and a version of Smale’s
Pathfollowing for optimal control of . . .
, 2010
"... MoreauYosida based approximation techniques for optimal control of variational inequalities are investigated. Properties of the path generated by solutions to the regularized equations are analyzed. Combined with a semismooth Newton method for the regularized problems these lead to an efficient nu ..."
Abstract
 Add to MetaCart
MoreauYosida based approximation techniques for optimal control of variational inequalities are investigated. Properties of the path generated by solutions to the regularized equations are analyzed. Combined with a semismooth Newton method for the regularized problems these lead to an efficient
A Polynomial PrimalDual PathFollowing Algorithm for Secondorder Cone Programming
 Research Memorandum No. 649, The Institute of Statistical Mathematics
, 1997
"... Secondorder cone programming (SOCP) is the problem of minimizing linear objective function over crosssection of secondorder cones and an affine space. Recently this problem gets more attention because of its various important applications including quadratically constrained convex quadratic progr ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
, and develop an analogue of HRVW/KSH/M direction, and establish O( p n log " 01 ), O(n log " 01 ) and O(n 3 log " 01 ) iterationcomplexity bounds for shortstep, semilongstep and longstep pathfollowing algorithms, respectively, to reduce the duality gap by a factor of "
A Convergence Analysis of the Scalinginvariant Primaldual Pathfollowing Algorithms for Secondorder Cone Programming
 Optim. Methods Softw
, 1998
"... This paper is a continuation of our previous paper in which we studied a polynomial primaldual pathfollowing algorithm for SOCP using an analogue of the HRVW/KSH/M direction for SDP. We develop an improved and simplified complexity analysis which can be also applied to the algorithm using the NT di ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
This paper is a continuation of our previous paper in which we studied a polynomial primaldual pathfollowing algorithm for SOCP using an analogue of the HRVW/KSH/M direction for SDP. We develop an improved and simplified complexity analysis which can be also applied to the algorithm using the NT
Removing camera shake from a single photograph
 ACM Trans. Graph
, 2006
"... Camera shake during exposure leads to objectionable image blur and ruins many photographs. Conventional blind deconvolution methods typically assume frequencydomain constraints on images, or overly simplified parametric forms for the motion path during camera shake. Real camera motions can follow c ..."
Abstract

Cited by 325 (16 self)
 Add to MetaCart
Camera shake during exposure leads to objectionable image blur and ruins many photographs. Conventional blind deconvolution methods typically assume frequencydomain constraints on images, or overly simplified parametric forms for the motion path during camera shake. Real camera motions can follow
Hamming embedding and weak geometric consistency for large scale image search
 In ECCV
, 2008
"... Abstract. This paper improves recent methods for large scale image search. Stateoftheart methods build on the bagoffeatures image representation. We, first, analyze bagoffeatures in the framework of approximate nearest neighbor search. This shows the suboptimality of such a representation for ..."
Abstract

Cited by 330 (35 self)
 Add to MetaCart
consistency constraints as well as their efficiency. Estimation of the full geometric transformation, i.e., a reranking step on a short list of images, is complementary to our weak geometric consistency constraints and allows to further improve the accuracy. 1
Detection of ShortStep Pulses Using Practical TestFunctions and Resonance Aspects
, 2008
"... An important aspect in modeling dynamic phenomena consists in measuring with higher accuracy some physical quantities corresponding to the dynamic system. Yet for measurements performed on limited time interval at high working frequency, certain intelligent methods should be added. The high working ..."
Abstract
 Add to MetaCart
working frequency requires that the measurement and data processing time interval should be greater than the time interval when the step input is received, so as to allow an accurate measurement. This paper will show that an intelligent processing method based on oscillating secondorder systems working
Results 11  20
of
4,407