Sciweavers

1177 search results - page 57 / 236
» Iterative methods for Robbins problems
Sort
View
77
Voted
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
15 years 5 months ago
Incremental low-discrepancy lattice methods for motion planning
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
Stephen R. Lindemann, Steven M. LaValle
113
Voted
JMLR
2010
161views more  JMLR 2010»
14 years 7 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
MP
2010
135views more  MP 2010»
14 years 11 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
124
Voted
SIAMJO
2011
14 years 7 months ago
Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
J. Carsten Ziems, Stefan Ulbrich
118
Voted
ICPR
2008
IEEE
16 years 1 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson