Results 1  10
of
447,004
Worst case complexity of direct search
, 2010
"... In this paper we prove that direct search of directional type shares the worst case complexity bound of steepest descent when sufficient decrease is imposed using a quadratic function of the step size parameter. This result is proved under smoothness of the objective function and using a framework o ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
In this paper we prove that direct search of directional type shares the worst case complexity bound of steepest descent when sufficient decrease is imposed using a quadratic function of the step size parameter. This result is proved under smoothness of the objective function and using a framework
On the WorstCase Complexity of the Silhouette of a Polytope
 In 15th Canadian Conference on Computational Geometry  CCCG’03
, 2003
"... We give conditions under which the worstcase size of the silhouette of a polytope is sublinear. We provide examples with linear size silhouette if any of these conditions is relaxed. Our bounds are the rst nontrivial bounds for the worstcase complexity of silhouettes. 1 ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We give conditions under which the worstcase size of the silhouette of a polytope is sublinear. We provide examples with linear size silhouette if any of these conditions is relaxed. Our bounds are the rst nontrivial bounds for the worstcase complexity of silhouettes. 1
Cryptographic functions from worstcase complexity assumptions
, 2007
"... Lattice problems have been suggested as a potential source of computational hardness to beused in the construction of cryptographic functions that are provably hard to break. A remarkable feature of latticebased cryptographic functions is that they can be proved secure (that is,hard to break on t ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
on the average) based on the assumption that the underlying lattice problems are computationally hard in the worstcase. In this paper we give a survey of the constructions andproof techniques used in this area, explain the importance of basing cryptographic functions on the worstcase complexity of lattice
Worstcase complexity of the optimal LLL algorithm
 In Proceedings of LATIN’2000  Punta del Este. LNCS 1776
"... . In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter t of the algorithm has its extreme value 1. This case is of interest because the output is then the strongest Lovaszreduced basis. Experiments reported by Lagarias and ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
and Odlyzko [LO83] seem to show that the algorithm remain polynomial in average. However no bound better than a naive exponential order one is established for the worst case complexity of the optimal LLL algorithm, even for fixed small dimension (higher than 2). Here we prove that, for any fixed dimension n
The worst case complexity of Maximum Parsimony
"... Abstract. One of the core classical problems in computational biology is that of constructing the most parsimonious phylogenetic tree interpreting an input set of sequences from the genomes of evolutionarily related organisms. We reexamine the classical Maximum Parsimony (MP) optimization problem f ..."
Abstract
 Add to MetaCart
for the general (asymmetric) scoring matrix case, where rooted phylogenies are implied, and analyze the worst case bounds of three approaches to MP: The approach of CavalliSforza and Edwards (CavalliSforza and Edwards, 1967), the approach of Hendy and Penny (Hendy and Penny, 1982), and a new agglomerative
On the optimal order of worst case complexity of direct search
, 2015
"... The worst case complexity of directsearch methods has been recently analyzed when they use positive spanning sets and impose a sufficient decrease condition to accept new iterates. For smooth unconstrained optimization, it is now known that such methods require at most O(n2ϵ2) function evaluations ..."
Abstract
 Add to MetaCart
The worst case complexity of directsearch methods has been recently analyzed when they use positive spanning sets and impose a sufficient decrease condition to accept new iterates. For smooth unconstrained optimization, it is now known that such methods require at most O(n2ϵ2) function evaluations
WISE: Automated test generation for worstcase complexity
 in ICSE
, 2009
"... Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to find performance bugs. Our complexity testing algorithm, which we call WISE (Worstcase Inputs from Symbolic Execution), ope ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to find performance bugs. Our complexity testing algorithm, which we call WISE (Worstcase Inputs from Symbolic Execution
Worst Case Complexity of Direct Search under Convexity
, 2014
"... In this paper we prove that the broad class of directsearch methods of directional type, based on imposing sufficient decrease to accept new iterates, exhibits the same worst case complexity bound and global rate of the gradient method for the unconstrained minimization of a convex and smooth funct ..."
Abstract
 Add to MetaCart
In this paper we prove that the broad class of directsearch methods of directional type, based on imposing sufficient decrease to accept new iterates, exhibits the same worst case complexity bound and global rate of the gradient method for the unconstrained minimization of a convex and smooth
Worst Case Complexity of Direct Search under Convexity
, 2013
"... In this paper we prove that the broad class of directsearch methods of directional type, based on imposing sufficient decrease to accept new iterates, exhibits the same global rate or worst case complexity bound of the gradient method for the unconstrained minimization of a convex and smooth functi ..."
Abstract
 Add to MetaCart
In this paper we prove that the broad class of directsearch methods of directional type, based on imposing sufficient decrease to accept new iterates, exhibits the same global rate or worst case complexity bound of the gradient method for the unconstrained minimization of a convex and smooth
Smoothing and WorstCase Complexity for DirectSearch Methods in Nonsmooth Optimization
, 2012
"... In the context of the derivativefree optimization of a smooth objective function, it has been shown that the worst case complexity of directsearch methods is of the same order as the one of steepest descent for derivativebased optimization, more precisely that the number of iterations needed to r ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In the context of the derivativefree optimization of a smooth objective function, it has been shown that the worst case complexity of directsearch methods is of the same order as the one of steepest descent for derivativebased optimization, more precisely that the number of iterations needed
Results 1  10
of
447,004