Evaluating bound-constrained minimization software

Bound-constrained minimization is a subject of active research. To assess the performance of existent solvers, numerical evaluations and comparisons are carried on. Arbitrary decisions that may have a crucial effect on the conclusions of numerical experiments are highlighted in the present work. As a result, a detailed evaluation based on performance profiles is applied to the comparison of bound-constrained minimization solvers. Extensive numerical results are presented and analyzed.

Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization

At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem resolution without satisfying the theoretical stopping conditions is not contemplated in usual convergence theories. However, in practice, one might not be able to solve the subproblem up to the required precision. This may be due to different reasons. One of them is that the presence of an excessively large penalty parameter could impair the performance of the box-constraint optimization solver. In this paper a practical strategy for decreasing the penalty parameter in situations like the one mentioned above is proposed. More generally, the different decisions that may be taken when, in practice, one is not able to solve the Augmented Lagrangian subproblem will be discussed. As a result, an improved Augmented Lagrangian method is presented, which takes into account numerical difficulties in a satisfactory way, preserving suitable convergence theory. Numerical experiments are presented involving all the CUTEr collection test problems.

The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems

Augmented Lagrangian methods are effective tools for solving large-scale nonlinear programming problems. At each outer iteration, a minimization subproblem with simple constraints, whose objective function depends on updated Lagrange multipliers and penalty parameters, is approximately solved. When the penalty parameter becomes very large, solving the subproblem becomes difficult; therefore, the effectiveness of this approach is associated with the boundedness of the penalty parameters. In this paper, it is proved that under more natural assumptions than the ones employed until now, penalty parameters are bounded. For proving the new boundedness result, the original algorithm has been slightly modified. Numerical consequences of the modifications are discussed and computational experiments are presented.

Constrained least square pre-distortion scheme for multiuser ultra-wideband

The study proposes a constrained least square (CLS) pre-distortion scheme for multiple-input single-output (MISO) multiple access ultra-wideband (UWB) systems. In such a scheme, a simple objective function is defined, which can be efficiently solved by a gradient-based algorithm. For the performance evaluation, scenarios CM1 and CM3 of the IEEE 802.15.3a channel model are considered. Results show that the CLS algorithm has a fast convergence and a good trade-off between intersymbol interference (ISI) and multiple access interference (MAI) reduction and signal-to-noise ratio (SNR) preservation, performing better than time-reversal (TR) pre-distortion.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.

Analytic perturbation theory for bound states in the transfer matrix spectrum of weakly correlated lattice ferromagnetic spin systems

We consider general d-dimensional lattice ferromagnetic spin systems with nearest neighbor interactions in the high temperature region ('beta' << 1). Each model is characterized by a single site apriori spin distribution taken to be even. We also take the parameter 'alfa' = ('S POT.4') - 3 '(S POT.2') POT.2' > 0, i.e. in the region which we call Gaussian subjugation, where ('S POT.K') denotes the kth moment of the apriori distribution. Associated with the model is a lattice quantum field theory known to contain a particle of asymptotic mass -ln 'beta' and a bound state below the two-particle threshold. We develop a 'beta' analytic perturbation theory for the binding energy of this bound state. As a key ingredient in obtaining our result we show that the Fourier transform of the two-point function is a meromorphic function, with a simple pole, in a suitable complex spectral parameter and the coefficients of its Laurent expansion are analytic in 'beta'.

Quantum entanglement of bound particles under free center of mass dispersion

On the basis of the full analytical solution of the overall unitary dynamics, the time evolution of entanglement is studied in a simple bipartite model system evolving unitarily from a pure initial state. The system consists of two particles in one spatial dimension bound by harmonic forces and having its free center of mass initially localized in space in a minimum uncertainty wavepacket. The existence of such initial states in which the bound particles are not entangled is discussed. Galilean invariance of the system ensures that the dynamics of entanglement between the two particles is independent of the wavepacket mean momentum. In fact, as shown, it is driven by the dispersive center of mass free dynamics, and evolves in a time scale that depends on the interparticle interaction in an essential way.

Supersymmetric Isospectral Formalism for the Calculation of Near-Zero Energy States: Application to the Very Weakly Bound He-4 Trimer Excited State

We propose a novel mathematical approach for the calculation of near-zero energy states by solving potentials which are isospectral with the original one. For any potential, families of strictly isospectral potentials (with very different shape) having desirable and adjustable features are generated by supersymmetric isospectral formalism. The near-zero energy Efimov state in the original potential is effectively trapped in the deep well of the isospectral family and facilitates more accurate calculation of the Efimov state. Application to the first excited state in He-4 trimer is presented.

Classical magnetoresistance of a ballistic electron gas constrained to non-planar topographies in a lattice of antidots under tilted magnetic field

The classical magnetoresistance of a two-dimensional electron gas constrained to non-planar topographies, in antidot lattices, and under the influence of tilted magnetic field in arbitrary direction is numerically studied. (C) 2012 Elsevier B.V. All rights reserved.

GREEN MACHINING ORIENTED TO DIMINISH DENSITY GRADIENT FOR MINIMIZATION OF DISTORTION IN ADVANCED CERAMICS

After sintering advanced ceramics, there are invariably distortions, caused in large part by the heterogeneous distribution of density gradients along the compacted piece. To correct distortions, machining is generally used to manufacture pieces within dimensional and geometric tolerances. Hence, narrow material removal limit conditions are applied, which minimize the generation of damage. Another alternative is machining the compacted piece before sintering, called the green ceramic stage, which allows machining without damage to mechanical strength. Since the greatest concentration of density gradients is located in the outer-most layers of the compacted piece, this study investigated the removal of different allowance values by means of green machining. The output variables are distortion after sintering, tool wear, cutting force, and the surface roughness of the green ceramics and the sintered ones. The following results have been noted: less distortion is verified in the sintered piece after 1mm allowance removal; and the higher the tool wear the worse the surface roughness of both green and sintered pieces.

Upregulation of soluble and membrane-bound human leukocyte antigen G expression is primarily observed in the milder histopathological stages of chronic hepatitis C virus infection

Chronic hepatitis C virus (HCV) infection is a worldwide health problem that may evolve to cirrhosis and hepatocellular carcinoma. Incompletely understood immune system mechanisms have been associated with impaired viral clearance. The nonclassical class I human leukocyte antigen G (HLA-G) molecule may downregulate immune system cell functions exhibiting well-recognized tolerogenic properties. HCV genotype was analyzed in chronic HCV-infected patients. Because HLA-G expression may be induced by certain viruses, we evaluated the presence of HLA-G in the liver microenvironment obtained from 89 biopsies of patients harboring chronic HCV infection and stratified according to clinical and histopathological features. Overall, data indicated that HCV genotype 1 was predominant, especially subgenotype 1a, with a prevalence of 87%. HLA-G expression was observed in 45(51%) liver specimens, and it was more frequent in milder stages of chronic hepatitis (67.4%) than in moderate (27.8%; p = 0.009) and severe (36.0%; p = 0.021) stages of the disease. Altogether, these results suggest that the expression of HLA-G in the context of HCV is a complex process modulated by many factors, which may contribute to an immunologic environment favoring viral persistence. However, because the milder forms predominantly expressed HLA-G, a protective role of this molecule may not be excluded. (C) 2012 American Society for Histocompatibility and Immunogenetics. Published by Elsevier Inc. All rights reserved.

Complete fusion enhancement and suppression of weakly bound nuclei at near barrier energies

We consider the influence of breakup channels on the complete fusion of weakly bound systems in terms of dynamic polarization potentials. It is argued that the enhancement of the cross section at sub-barrier energies may be consistent with recent experimental observations that nucleon transfer, often leading to breakup, is dominant compared to direct breakup. The main trends of the experimental complete fusion cross sections are analyzed in the framework of the DPP approach. The qualitative conclusions are supported by CDCC calculations including a sequential breakup channel, the one neutron stripping of Li-7 followed by the breakup of Li-6.

A multi-objective adaptive immune algorithm for multi-application NoC mapping

Current SoC design trends are characterized by the integration of larger amount of IPs targeting a wide range of application fields. Such multi-application systems are constrained by a set of requirements. In such scenario network-on-chips (NoC) are becoming more important as the on-chip communication structure. Designing an optimal NoC for satisfying the requirements of each individual application requires the specification of a large set of configuration parameters leading to a wide solution space. It has been shown that IP mapping is one of the most critical parameters in NoC design, strongly influencing the SoC performance. IP mapping has been solved for single application systems using single and multi-objective optimization algorithms. In this paper we propose the use of a multi-objective adaptive immune algorithm (M(2)AIA), an evolutionary approach to solve the multi-application NoC mapping problem. Latency and power consumption were adopted as the target multi-objective functions. To compare the efficiency of our approach, our results are compared with those of the genetic and branch and bound multi-objective mapping algorithms. We tested 11 well-known benchmarks, including random and real applications, and combines up to 8 applications at the same SoC. The experimental results showed that the M(2)AIA decreases in average the power consumption and the latency 27.3 and 42.1 % compared to the branch and bound approach and 29.3 and 36.1 % over the genetic approach.

Self-bound interacting QCD matter in compact stars

The quark gluon plasma (QGP) at zero temperature and high baryon number is a system that may be present inside compact stars. It is quite possible that this cold QGP shares some relevant features with the hot QGP observed in heavy ion collisions, being also a strongly interacting system. In a previous work we have derived from the QCD Lagrangian an equation of state (EOS) for the cold QGP, which can be considered an improved version of the MIT bag-model EOS. Compared to the latter, our EOS reaches higher values of the pressure at comparable baryon densities. This feature is due to perturbative corrections and also to nonperturbative effects. Here we apply this EOS to the study of neutron stars, discussing the absolute stability of quark matter and computing the mass-radius relation for self-bound (strange) stars. The maximum masses of the sequences exceed two solar masses, in agreement with the recently measured values of the mass of the pulsar PSR J1614-2230, and the corresponding radii of around 10-11 km.

Quasi-bound alpha resonant states populated by the 12C(6Li,d) reaction.

Several narrow alpha resonant 16O states were detected through the 12C(6Li,d) reaction, in the range of 12 to 17 MeV of excitation energy. The reaction was measured at a bombarding energy of 25.5 MeV employing the São Paulo Pelletron-Enge-Spectrograph facility and the nuclear emulsion technique. Experimental angular distributions associated with four natural parity quasi-bound states ncar the 4α threshold are presented and compared to DWBA predictions.