Proximal methods for nonlinear programming: double regularization and inexact subproblems

This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

New Optimization Algorithms for Structural Reliability Analysis

Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-Lind-Rackwitz-Fiessler (HLRF) algorithm, developed specifically for this purpose, has been shown to be efficient but not robust, as it fails to converge for a significant number of problems. On the other hand, recent developments in general (augmented Lagrangian) optimization techniques have not been tested in aplication to structural reliability problems. In the present article, three new optimization algorithms for structural reliability analysis are presented. One algorithm is based on the HLRF, but uses a new differentiable merit function with Wolfe conditions to select step length in linear search. It is shown in the article that, under certain assumptions, the proposed algorithm generates a sequence that converges to the local minimizer of the problem. Two new augmented Lagrangian methods are also presented, which use quadratic penalties to solve nonlinear problems with equality constraints. Performance and robustness of the new algorithms is compared to the classic augmented Lagrangian method, to HLRF and to the improved HLRF (iHLRF) algorithms, in the solution of 25 benchmark problems from the literature. The new proposed HLRF algorithm is shown to be more robust than HLRF or iHLRF, and as efficient as the iHLRF algorithm. The two augmented Lagrangian methods proposed herein are shown to be more robust and more efficient than the classical augmented Lagrangian method.

The correspondence between methods of digital division and multiplier recording procedures,

Bibliography: p. 31.

A POSTERIORI ERROR CONTROL OF DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC OBSTACLE PROBLEMS

In this article, we derive an a posteriori error estimator for various discontinuous Galerkin (DG) methods that are proposed in (Wang, Han and Cheng, SIAM J. Numer. Anal., 48: 708-733, 2010) for an elliptic obstacle problem. Using a key property of DG methods, we perform the analysis in a general framework. The error estimator we have obtained for DG methods is comparable with the estimator for the conforming Galerkin (CG) finite element method. In the analysis, we construct a non-linear smoothing function mapping DG finite element space to CG finite element space and use it as a key tool. The error estimator consists of a discrete Lagrange multiplier associated with the obstacle constraint. It is shown for non-over-penalized DG methods that the discrete Lagrange multiplier is uniformly stable on non-uniform meshes. Finally, numerical results demonstrating the performance of the error estimator are presented.

Occurrence of Brachyspira hyodysenteriae in multiplier pig herds in Switzerland

OBJECTIVE: This research was aimed to determine the occurrence of Brachyspira (B.) hyodysenteriae in Swiss multiplier pig herds. MATERIALS AND METHODS: In a pilot study a direct real-time polymerase chain reaction (PCR) method for B. hyodysenteriae was compared to culture followed by PCR on 106 samples from three herds. Subsequently 40 multiplier herds were epidemiologically characterized and analysed for the presence of B. hyodysenteriae using direct PCR on 1412 rectal swabs. For external validation 20 swabs obtained from two positive conventional herds were analysed. RESULTS: The comparison of direct PCR with culture followed by PCR resulted in a moderate agreement (kappa index: 0.58). In the two conventional herds, 35% of the samples (7/20) tested positive. Samples from 39 multipliers tested negative. In one multiplier herd, 25% (9/36) of the samples tested PCR positive. Risk factors in the multiplier herd may have been rodents or birds, but not pig purchase. CONCLUSION AND CLINICAL RELEVANCE: B. hyodysenteriae have been detected in a Swiss multiplier herd, which underlines the threat of potential spread by replacement pigs. Consequently, a Brachyspira monitoring programme was established for Swiss multiplier herds.

A note on Atrubin's real-time iterative multiplier /

"UIUCDCS-R-74-640"

Relative accuracy and predictive ability of direct valuation methods, price to aggregate earnings method and a hybrid approach

In this paper, we assess the relative performance of the direct valuation method and industry multiplier models using 41 435 firm-quarter Value Line observations over an 11 year (1990–2000) period. Results from both pricingerror and return-prediction analyses indicate that direct valuation yields lower percentage pricing errors and greater return prediction ability than the forward price to aggregated forecasted earnings multiplier model. However, a simple hybrid combination of these two methods leads to more accurate intrinsic value estimates, compared to either method used in isolation. It would appear that fundamental analysis could benefit from using one approach as a check on the other.