Sciweavers

2182 search results - page 63 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
MP
2008
117views more  MP 2008»
13 years 7 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
MP
2008
81views more  MP 2008»
13 years 7 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh
EOR
2010
140views more  EOR 2010»
13 years 5 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
AIPS
2009
13 years 8 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
FLOPS
2008
Springer
13 years 9 months ago
Integrating Answer Set Reasoning with Constraint Solving Techniques
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Veena S. Mellarkod, Michael Gelfond