Sciweavers

1710 search results - page 58 / 342
» High-Level Programs and Program Conditions
Sort
View
TAPIA
2003
ACM
14 years 1 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez
MP
2008
91views more  MP 2008»
13 years 8 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang
CSR
2011
Springer
12 years 11 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
GECCO
2003
Springer
108views Optimization» more  GECCO 2003»
14 years 1 months ago
Evolutionary Testing of Flag Conditions
Evolutionary Testing (ET) has been shown to be very successful in testing real world applications [16]. However, it has been pointed out [11], that further research is necessary if...
André Baresel, Harmen Sthamer
HIPEAC
2007
Springer
14 years 2 months ago
MiDataSets: Creating the Conditions for a More Realistic Evaluation of Iterative Optimization
Abstract. Iterative optimization has become a popular technique to obtain improvements over the default settings in a compiler for performance-critical applications, such as embedd...
Grigori Fursin, John Cavazos, Michael F. P. O'Boyl...