نتایج جستجو برای: augmented downhill simplex method adsm

تعداد نتایج: 1697296  

2017
Joao Vasconcelos Laurent Krähenbühl Laurent Nicolas Alain Nicolas J. A. Vasconcelos Nicolas A. Nicolas

1994
Michael R. Osborne

This report considers the solution of estimation problems based on the maximum likelihood principle when a xed number of equality constraints are imposed on the problem. Consistency and the asymptotic distribution of the parameter estimates as n ! 1, where n is the number of observations, are discussed, and it is shown that a suitably scaled limiting multiplier vector is known. It is suggested ...

2005
C. Beltran-Royo

The Kelley cutting plane method is one of the methods commonly used to optimize the dual function in the Lagrangian relaxation scheme. Usually the Kelley cutting plane method uses the simplex method as the optimization engine. It is well known that the simplex method leaves the current vertex, follows an ascending edge and stops at the nearest vertex. What would happen if one would continue the...

2016
Bill Casselman

ci = 1, and all Pi in Σ. For example, the line segment between two points P and Q is the convex hull of those two points. This is clearly convex. An extremal point of a convex region is a point that does not lie on the interior of a line segment in the region. Any convex region is the convex hull of its extremal points. As was proved in [Weyl:1935], the convex hull of any finite set of points a...

2016
Joshua C. Berkowitz Sushma Bhusal Deepak Desai Maurice A. Cerulli Sumant Inamdar

Downhill esophageal varices are a rare cause of upper gastrointestinal hemorrhage. We present a case of downhill variceal bleeding due to superior vena cava thrombosis resulting from a prior central venous catheter. The patient was managed with endoscopic band ligation and later with surgical axillary vein to right atrium bypass grafting. Successful long-term resolution of varices was achieved ...

Journal: :INFORMS Journal on Computing 2000
Robert E. Bixby Alexander Martin

We study the parallelization of the steepest-edge version of the dual sim-plex algorithm. Three diierent parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2016
Wookyung Yu Michael C Baxa Isabelle Gagnon Karl F Freed Tobin R Sosnick

The relationship between folding cooperativity and downhill, or barrier-free, folding of proteins under highly stabilizing conditions remains an unresolved topic, especially for proteins such as λ-repressor that fold on the microsecond timescale. Under aqueous conditions where downhill folding is most likely to occur, we measure the stability of multiple H bonds, using hydrogen exchange (HX) in...

Journal: :J. Computational Applied Mathematics 2013
Zhi Zhao Zheng-Jian Bai Guizhi Chen

We consider the nonnegative inverse eigenvalue problem with partial eigendata, which aims to find a nonnegative matrix such that it is nearest to a pre-estimated nonnegative matrix and satisfies the prescribed eigendata. In this paper, we propose several iterative schemes based on the alternating direction method of multipliers for solving the nonnegative inverse problem. We also extend our sch...

1998
Daoqi Yang

An augmented Lagrangian iterative scheme for mixed nite element methods is proposed and analyzed in an abstract framework. This framework is put in a general and computationally eecient fashion, and is based on the idea of iteratively penalizing the mixed nite element scheme. It is shown that the scheme has geometrical convergence.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید