Sciweavers

1997 search results - page 102 / 400
» On the convergence of Hill's method
Sort
View
SIAMJO
2010
84views more  SIAMJO 2010»
14 years 11 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
JMLR
2010
161views more  JMLR 2010»
14 years 8 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
PROCEDIA
2010
103views more  PROCEDIA 2010»
14 years 8 months ago
The Deflated Relaxed Incomplete Cholesky CG method for use in a real-time ship simulator
Ship simulators are used for training purposes and therefore have to calculate realistic wave patterns around the moving ship in real time. We consider a wave model that is based ...
E. van't Wout, M. B. van Gijzen, A. Ditzel, Auke v...
SIAMIS
2010
190views more  SIAMIS 2010»
14 years 8 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
SIAMJO
2010
97views more  SIAMJO 2010»
14 years 8 months ago
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh