A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.

Patterns in parabolic problems with nonlinear boundary conditions

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

MANY-BODY PROBLEMS WITH COMPOSITE-PARTICLES AND Q-HEISENBERG ALGEBRAS

We propose to employ deformed commutation relations to treat many-body problems of composite particles. The deformation parameter is interpreted as a measure of the effects of the statistics of the internal degrees of freedom of the composite particles. A simple application of the method is made for the case of a gas of composite bosons.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Optimal control problems with nonsmooth mixed constraints

In this paper we present a weak maximum principle for optimal control problems involving mixed constraints and pointwise set control constraints. Notably such result holds for problems with possibly nonsmooth mixed constraints. Although the setback of such result resides on a convexity assumption on the extended velocity set, we show that if the number of mixed constraints is one, such convexity assumption may be removed when an interiority assumption holds. © 2008 IEEE.

Solution of two-body bound state problems with confining potentials

The homogeneous Lippmann-Schwinger integral equation is solved in momentum space by using confining potentials. Since the confining potentials are unbounded at large distances, they lead to a singularity at small momentum. In order to remove the singularity of the kernel of the integral equation, a regularized form of the potentials is used. As an application of the method, the mass spectra of heavy quarkonia, mesons consisting from heavy quark and antiquark (Υ(bb̄), ψ(cc̄)), are calculated for linear and quadratic confining potentials. The results are in good agreement with configuration space and experimental results. © 2010 American Institute of Physics.

The use of molecular spectra simulation for diagnostics of reactive flows

The C 2 * radical is used as a system probe tool to the reactive flow diagnostic, and it was chosen due to its large occurrence in plasma and combustion in aeronautics and aerospace applications. The rotational temperatures of C 2 * species were determined by the comparison between experimental and theoretical data. The simulation code was developed by the authors, using C++ language and the object oriented paradigm, and it includes a set of new tools that increase the efficacy of the C 2 * probe to determine the rotational temperature of the system. A brute force approach for the determination of spectral parameters was adopted in this version of the computer code. The statistical parameter c 2 was used as an objective criterion to determine the better match of experimental and synthesized spectra. The results showed that the program works even with low-quality experimental data, typically collected from in situ airborne compact apparatus. The technique was applied to flames of a Bunsen burner, and the rotational temperature of ca. 2100 K was calculated.

Singularly perturbed biharmonic problems with superlinear nonlinearities

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Pruning methods to MLP neural networks considering proportional apparent error rate for classification problems with unbalanced data

This article deals with classification problems involving unequal probabilities in each class and discusses metrics to systems that use multilayer perceptrons neural networks (MLP) for the task of classifying new patterns. In addition we propose three new pruning methods that were compared to other seven existing methods in the literature for MLP networks. All pruning algorithms presented in this paper have been modified by the authors to do pruning of neurons, in order to produce fully connected MLP networks but being small in its intermediary layer. Experiments were carried out involving the E. coli unbalanced classification problem and ten pruning methods. The proposed methods had obtained good results, actually, better results than another pruning methods previously defined at the MLP neural network area. (C) 2014 Elsevier Ltd. All rights reserved.

Graded meshes in bio-thermal problems with transmission-line modeling method

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

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.

SUPERLINEAR ELLIPTIC PROBLEMS WITH SIGN CHANGING COEFFICIENTS

Via variational methods, we study multiplicity of solutions for the problem {-Delta u = lambda b(x)vertical bar u vertical bar(q-2)u + au + g(x, u) in Omega, u - 0 on partial derivative Omega, where a simple example for g( x, u) is |u|(p-2)u; here a, lambda are real parameters, 1 < q < 2 < p <= 2* and b(x) is a function in a suitable space L-sigma. We obtain a class of sign changing coefficients b(x) for which two non-negative solutions exist for any lambda > 0, and a total of five nontrivial solutions are obtained when lambda is small and a >= lambda(1). Note that this type of results are valid even in the critical case.