Sciweavers

368 search results - page 13 / 74
» Some new iterative methods with three-order convergence
Sort
View
EOR
2008
103views more  EOR 2008»
13 years 7 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
NA
2010
69views more  NA 2010»
13 years 6 months ago
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...
Marina Andretta, Ernesto G. Birgin, José Ma...
UAI
2004
13 years 9 months ago
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
Trey Smith, Reid G. Simmons
SIAMJO
2000
108views more  SIAMJO 2000»
13 years 7 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 7 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov