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.

Evaluation of an average numerator relationship matrix model and a Bayesian hierarchical model for growth traits in Nellore cattle with uncertain paternity

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Comparison between Two Methods to Calculate the Transition Matrix of Orbit Motion

Two methods to evaluate the state transition matrix are implemented and analyzed to verify the computational cost and the accuracy of both methods. This evaluation represents one of the highest computational costs on the artificial satellite orbit determination task. The first method is an approximation of the Keplerian motion, providing an analytical solution which is then calculated numerically by solving Kepler's equation. The second one is a local numerical approximation that includes the effect of J(2). The analysis is performed comparing these two methods with a reference generated by a numerical integrator. For small intervals of time (1 to 10s) and when one needs more accuracy, it is recommended to use the second method, since the CPU time does not excessively overload the computer during the orbit determination procedure. For larger intervals of time and when one expects more stability on the calculation, it is recommended to use the first method.

Control charts for monitoring the mean vector and the covariance matrix of bivariate processes

In this article, we propose new control charts for monitoring the mean vector and the covariance matrix of bivariate processes. The traditional tools used for this purpose are the T (2) and the |S| charts. However, these charts have two drawbacks: (1) the T (2) and the |S| statistics are not easy to compute, and (2) after a signal, they do not distinguish the variable affected by the assignable cause. As an alternative to (1), we propose the MVMAX chart, which only requires the computation of sample means and sample variances. As an alternative to (2), we propose the joint use of two charts based on the non-central chi-square statistic (NCS statistic), named as the NCS charts. Once the NCS charts signal, the user can immediately identify the out-of-control variable. In general, the synthetic MVMAX chart is faster than the NCS charts and the joint T (2) and |S| charts in signaling processes disturbances.

Fast-forward/fast-backward substitutions on vector computers

This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different approach has been presented using dependency-based substitution algorithm (DBSA). In this paper the focus is on new algorithms able to explore the sparsity of the vectors. The efficiency is tested using linear systems from power systems with 118, 320, 725 and 1729 buses. The tests were performed on a CRAY Y MP2E/232. The speedups for a fast-forward/fast-backward using a 1729-bus system are near 19 and 14 for real and complex arithmetic operations, respectively. When forward/backward is employed the speedups are about 8 and 6 to perform the same simulations.

On relaxed LMI-based design for fuzzy controllers

Relaxed conditions for stability of nonlinear continuous-time systems given by fuzzy models axe presented. A theoretical analysis shows that the proposed method provides better or at least the same results of the methods presented in the literature. Digital simulations exemplify this fact. This result is also used for fuzzy regulators design. The nonlinear systems are represented by fuzzy models proposed by Takagi and Sugeno. The stability analysis and the design of controllers axe described by LMIs (Linear Matrix Inequalities), that can be solved efficiently using convex programming techniques.

On relaxed LMI-based designs for fuzzy regulators and fuzzy observers

Relaxed conditions for stability of nonlinear, continuous and discrete-time systems given by fuzzy models are presented. A theoretical analysis shows that the proposed methods provide better or at least the same results of the methods presented in the literature. Numerical results exemplify this fact. These results are also used for fuzzy regulators and observers designs. The nonlinear systems are represented by fuzzy models proposed by Takagi and Sugeno. The stability analysis and the design of controllers are described by linear matrix inequalities, that can be solved efficiently using convex programming techniques. The specification of the decay rate, constrains on control input and output are also discussed.

Monitoring the mean vector and the covariance ­matrix of multivariate processes with sample means and sample ranges

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

NORDSIECK FORMS OF STIFFLY-STABLE ADAMS-TYPE CYCLIC METHODS THAT ARE INSENSITIVE TO STEP-SIZE CHANGES

In this paper we determine a matrix S and a vector l for stiffly-stable Adams-type cyclic methods that are insensitive to step size changes by using the definition of equivalent methods, (see, e.g. [l]), in the Nordsieck notation. The elements S and l, written in a parametric form, permit us to represent in Nordsieck form the methods that were constructed in [7] and the new methods that satisfy the above properties.