Existence and multiplicity of solutions for a prescribed mean-curvature problem with critical growth

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

Problem with the superstring action of Deriglazov and Galajinsky

Deriglazov and Galajinsky have recently proposed a new covariant action for the Green-Schwarz superstring which can be constructed in any spacetime dimension. In this Comment, I show that their action contains extra on-shell degrees of freedom as compared with the standard action and is therefore inequivalent. ©1999 The American Physical Society.

Análise não-diferenciável e condições necessárias de otimalidade para problema de controle ótimo com restrições mistas

Pós-graduação em Matemática - IBILCE

Saddle Point and Second Order Optimality in Nondifferentiable Nonlinear Abstract Multiobjective Optimization

This article deals with a vector optimization problem with cone constraints in a Banach space setting. By making use of a real-valued Lagrangian and the concept of generalized subconvex-like functions, weakly efficient solutions are characterized through saddle point type conditions. The results, jointly with the notion of generalized Hessian (introduced in [Cominetti, R., Correa, R.: A generalized second-order derivative in nonsmooth optimization. SIAM J. Control Optim. 28, 789–809 (1990)]), are applied to achieve second order necessary and sufficient optimality conditions (without requiring twice differentiability for the objective and constraining functions) for the particular case when the functionals involved are defined on a general Banach space into finite dimensional ones.

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

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

Reformulation of variational inequalities on a simplex and compactification of complementarity problems

Many variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied, including smooth reformulations with simple constraints and unconstrained reformulations based on the penalized Fischer-Burmeister function. It is proved that bounded level set results hold for these reformulations under quite general assumptions on the operator. Therefore, it can be guaranteed that minimization algorithms generate bounded sequences and, under monotonicity conditions, these algorithms necessarily nd solutions of the original problem. Some numerical experiments are presented.

Constraints implementation for IQML and mode direction-of-arrival estimators

The iterative quadratic maximum likelihood IQML and the method of direction estimation MODE are well known high resolution direction-of-arrival DOA estimation methods. Their solutions lead to an optimization problem with constraints. The usual linear constraint presents a poor performance for certain DOA values. This work proposes a new linear constraint applicable to both DOA methods and compare their performance with two others: unit norm and usual linear constraint. It is shown that the proposed alternative performs better than others constraints. The resulting computational complexity is also investigated.

An efficient codification to solve distribution network reconfiguration for loss reduction problem

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

Um método previsor-corretor primal-dual de pontos interiores barreira logarítmica modificada, com estratégias de convergência global e de ajuste cúbico, para problemas de programação não-linear e não-convexa

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Position-dependent effective mass Dirac equations with PT-symmetric and non-PT-symmetric potentials

We present a new procedure to construct the one-dimensional non-Hermitian imaginary potential with a real energy spectrum in the context of the position-dependent effective mass Dirac equation with the vector-coupling scheme in 1 + 1 dimensions. In the first example, we consider a case for which the mass distribution combines linear and inversely linear forms, the Dirac problem with a PT-symmetric potential is mapped into the exactly solvable Schrodinger-like equation problem with the isotonic oscillator by using the local scaling of the wavefunction. In the second example, we take a mass distribution with smooth step shape, the Dirac problem with a non-PT-symmetric imaginary potential is mapped into the exactly solvable Schrodinger-like equation problem with the Rosen-Morse potential. The real relativistic energy levels and corresponding wavefunctions for the bound states are obtained in terms of the supersymmetric quantum mechanics approach and the function analysis method.

An effective singular oscillator for Duffin-Kemmer-Petiau particles with a nonminimal vector coupling: a two-fold degeneracy

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Bound constrained smooth optimization for solving variational inequalities and related problems

Variational inequalities and related problems may be solved via smooth bound constrained optimization. A comprehensive discussion of the important features involved with this strategy is presented. Complementarity problems and mathematical programming problems with equilibrium constraints are included in this report. Numerical experiments are commented. Conclusions and directions of future research are indicated.

The LQ control problem for Markovian jumps linear systems with horizon defined by stopping times

This paper deals with a stochastic optimal control problem involving discrete-time jump Markov linear systems. The jumps or changes between the system operation modes evolve according to an underlying Markov chain. In the model studied, the problem horizon is defined by a stopping time τ which represents either, the occurrence of a fix number N of failures or repairs (TN), or the occurrence of a crucial failure event (τΔ), after which the system is brought to a halt for maintenance. In addition, an intermediary mixed case for which T represents the minimum between TN and τΔ is also considered. These stopping times coincide with some of the jump times of the Markov state and the information available allows the reconfiguration of the control action at each jump time, in the form of a linear feedback gain. The solution for the linear quadratic problem with complete Markov state observation is presented. The solution is given in terms of recursions of a set of algebraic Riccati equations (ARE) or a coupled set of algebraic Riccati equation (CARE).

Risk/investment-driven transmission expansion planning with multiple scenarios

This study presents a new methodology based on risk/investment to solve transmission network expansion planning (TNEP) problem with multiple future scenarios. Three mathematical models related to TNEP problems considering multiple future generation and load scenarios are also presented. These models will provide planners with a meaningful risk assessment that enable them to determine the necessary funding for transmission lines at a permissible risk level. The results using test and real systems show that the proposed method presents better solutions compared with scenario analysis method. ©The Institution of Engineering and Technology 2013.