Filters








11,402 Hits in 7.8 sec

On monotonicity in the scaled potential algorithm for linear programming

Kurt M. Anstreicher
1991 Linear Algebra and its Applications  
Based on computational experience with the standard form projective algorithm, the monotonicity modification should substantially improve the performance of the algorithm when it is initialized with a  ...  Imposing monotonicity on primal steps also results in stronger lower bound updates, which is not the case with the standard form projective algorithm.  ...  The standard form variant applies directly to a standard form linear program, as opposed to the combined primal-dual problem required by the original algorithm, and adds a procedure for updating lower  ... 
doi:10.1016/0024-3795(91)90276-3 fatcat:35yeldiksfe53lcoy64edgycxm

Page 6123 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
City, IA) Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming.  ...  Programming 62 (1993), no. 3, Ser. A, 517-535. Summary: “In a recent paper, Shaw and Goldfarb showed that a version of the standard form projective algorithm can achieve O(.  ... 

Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes [article]

Oleksandr Shlakhter, Chi-Guhn Lee, Dmitry Khmelev, Nasser Jaber
2008 arXiv   pre-print
Inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP, we establish a class of operators that can be used in combination  ...  with a contraction mapping operator in the standard value iteration algorithm and its variants.  ...  Dmitry Khmelev, who was a postdoctoral fellow in the Department of Mathematics at University of Toronto before he passed away in 2004.  ... 
arXiv:math/0506489v2 fatcat:xanszf7gf5edvoivexunx7pc5y

Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes

Oleksandr Shlakhter, Chi-Guhn Lee, Dmitry Khmelev, Nasser Jaber
2010 Operations Research  
The approach is inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP.  ...  This paper sheds light on a new research avenue of combining the two-well studied theories of optimization -linear programing and Markov decision processes -to hope for surmounting the curse of dimensionality  ...  Dmitry Khmelev, who was a postdoctoral fellow in the Department of Mathematics at University of Toronto before he passed away in 2004.  ... 
doi:10.1287/opre.1090.0705 fatcat:rs2tr3mp65binovjpce2zar7ti

Interior-point methods

Florian A. Potra, Stephen J. Wright
2000 Journal of Computational and Applied Mathematics  
We review some of the key developments in the area, and include comments on the complexity theory and practical algorithms for linear programming, semi-deÿnite programming, monotone linear complementarity  ...  In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semi-deÿnite  ...  We are grateful to an anonymous referee for a speedy but thorough review.  ... 
doi:10.1016/s0377-0427(00)00433-7 fatcat:kwhchrvwcncsvmkd7cdjy3wpny

Primal-dual interior-point methods [chapter]

2010 Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization  
W e review some of the key developments in the area, including comments on both the complexity theory and practical algorithms for linear programming, semide nite programming, monotone linear complementarity  ...  In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such a s c o n vex quadratic programming,  ...  We are grateful to an anonymous referee for a speedy but thorough review.  ... 
doi:10.1090/fim/027/04 fatcat:ps2izalopfhetgouzqqjcy7oti

Temporal Difference Methods for General Projected Equations

Dimitri P. Bertsekas
2011 IEEE Transactions on Automatic Control  
These algorithms originated in approximate dynamic programming (DP), where they are collectively known as temporal difference (TD) methods.  ...  We consider projected equations for approximate solution of high-dimensional fixed point problems within low-dimensional subspaces.  ...  ACKNOWLEDGMENT The author would like to gratefully acknowledge V. Borkar, J. Tsitsiklis, and H. Yu for helpful comments and Me.  ... 
doi:10.1109/tac.2011.2115290 fatcat:7glivvktxbcpronhjrooiynl7u

Recent Developments in Interior-Point Methods [chapter]

Stephen J. Wright
2000 IFIP Advances in Information and Communication Technology  
In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semidefinite  ...  The modern era of interior-point methods dates to 1984, when Karmarkar proposed his algorithm for linear programming.  ...  Powell and the other organizers of the IFIP TC7 '99 conference for arranging a most enjoyable and interesting meeting, and for a dose reading of the paper which resulted in many improvements.  ... 
doi:10.1007/978-0-387-35514-6_14 fatcat:chzlfupe7bbhbdyynhatlckjcu

A Modular Static Analysis Approach to Affine Loop Invariants Detection

Corinne Ancourt, Fabien Coelho, François Irigoin
2010 Electronical Notes in Theoretical Computer Science  
We present an algorithm to compute the transitive closure of such a state transformer, and we illustrate its performance on various examples.  ...  Our algorithm is simple, based on discrete differentiation and integration: it is very different from the usual abstract interpretation fixed point computation based on widening.  ...  Nguyen who performed tedious experiments and screened the results for missing information. P. Jouvelot and reviewers suggested many improvements in the presentation and in the related work. L.  ... 
doi:10.1016/j.entcs.2010.09.002 fatcat:osqcu64herh57etx4gsyhid7dm

Transformation Learning Via Kernel Alignment

Andrew Howard, Tony Jebara
2009 2009 International Conference on Machine Learning and Applications  
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks.  ...  These transformations take the form of a mixture of base transformations and are learned by maximizing the kernel alignment criterion.  ...  Results for each dataset (the three target monotonic functions, linear, exponential and square root) are reported in their respective columns as well as the average in the Avg column.  ... 
doi:10.1109/icmla.2009.124 dblp:conf/icmla/HowardJ09 fatcat:2g6h3yzrfrbp7mqhjlh5slo27a

Multiagent Evaluation Mechanisms

Tal Alon, Magdalen Dobson, Ariel Procaccia, Inbal Talgam-Cohen, Jamie Tucker-Foltz
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
By contrast, we investigate the general, multi-agent model, and provide a complete characterization of its computational complexity.  ...  Previous work has studied this problem in the case of a single agent.  ...  Part of this work was done while Dobson was visiting the Technion via the MISTI-MIT Israel Program.  ... 
doi:10.1609/aaai.v34i02.5543 fatcat:eru3izxuwza57bk24l6oe5oiz4

Mathematical programming algorithms for regression-based nonlinear filtering in R/sup N/

N.D. Sidiropoulos, R. Bro
1999 IEEE Transactions on Signal Processing  
Although the result does not carry over to least squares regression, hybrid programming algorithms can be developed to solve least squares counterparts of certain problems in the class.  ...  Examples include locally monotonic, piecewise monotonic, runlength constrained, and unimodal and oligomodal regression.  ...  ACKNOWLEDGMENT The work of the first author was motivated in part by earlier work of A. Bovik and A. Restrepo (Palacios).  ... 
doi:10.1109/78.747782 fatcat:w4b7rgribzf3dchudrxj4tqg2i

DBSP: Automatic Incremental View Maintenance for Rich Query Languages [article]

Mihai Budiu, Frank McSherry, Leonid Ryzhyk, Val Tannen
2022 arXiv   pre-print
for solving the incremental view maintenance problem for arbitrary DBSP programs, and (3) we show how to model many rich database query languages (including the full relational queries, grouping and aggregation  ...  , monotonic and non-monotonic recursion, and streaming aggregation) using DBSP.  ...  The incrementalization operator has some very nice algebraic properties, which can generate very efficient incremental implementations for linear and bilinear computations.  ... 
arXiv:2203.16684v1 fatcat:wj6r5ontrrblha45r5wzmvob7u

Introduction to set constraint-based program analysis

Alexander Aiken
1999 Science of Computer Programming  
Several standard analysis problems are formulated using set constraints, which serves both to illustrate the style of using constraints to specify program analysis problems and the range of application  ...  This paper gives an introduction to using set constraints to specify program analyses.  ...  Acknowledgements This paper is based in part on an invited talk on constraint-based program analysis given with Nevin Heintze at the ACM Symposium on Principles of Programming Languages in 1995.  ... 
doi:10.1016/s0167-6423(99)00007-6 fatcat:oy472dhyb5hhvfc5cmaproi734

The Complexity of Integer Bound Propagation

L. Bordeaux, G. Katsirelos, N. Narodytska, M. Y. Vardi
2011 The Journal of Artificial Intelligence Research  
The procedure invokes constraint propagators until a common fixpoint is reached, but the known algorithms for this have a pseudo-polynomial worst-case time complexity: they are fast indeed when the variables  ...  In particular we show that this fixpoint computation is in fact NP-complete, even when restricted to binary linear constraints.  ...  Acknowledgments Preliminary results of Bordeaux, Hamadi, and Vardi (2007) showed the NP-completeness of propagation in the case where quadratic constraints are considered (Prop. 3). This 5.  ... 
doi:10.1613/jair.3248 fatcat:wjzo7vkh2fgjhip6yb6w3sk7ii
« Previous Showing results 1 — 15 out of 11,402 results