Sciweavers

51 search results - page 9 / 11
» Newton's method for overdetermined systems of equations
Sort
View
SIAMJO
2008
79views more  SIAMJO 2008»
15 years 6 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
ANSS
2007
IEEE
15 years 10 months ago
MDL, A Domain-Specific Language for Molecular Dynamics
Molecular Dynamics (MD) involves solving Newton's equations of motion for a molecular system and propagating the system by time-dependent updates of atomic positions and velo...
Trevor M. Cickovski, Chris Sweet, Jesús A. ...
CP
2008
Springer
15 years 7 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
GIS
2008
ACM
16 years 7 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
MP
2011
14 years 9 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb