Interference phenomenon for the Faddeevian regularization of 2D chiral fermionic determinants

The classification of the regularization ambiguity of a 2D fermionic determinant in three different classes according to the number of second-class constraints, including the new Faddeevian regularization, is examined and extended. We find a new and important result that the Faddeevian class, with three second-class constraints, possesses a free continuous one parameter family of elements. The criterion of unitarity restricts the parameter to the same range found earlier by Jackiw and Rajaraman for the two-constraint class. We studied the restriction imposed by the interference of right-left modes of the chiral Schwinger model (χQED2) using Stone's soldering formalism. The interference effects between right and left movers, producing the massive vectorial photon, are shown to constrain the regularization parameter to belong to the four-constraint class which is the only nonambiguous class with a unique regularization parameter. ©1999 The American Physical Society.

Remark on the muonium to antimuonium conversion in a 3-3-1 model

Here we analyze the relation between the search for muonium to antimuonium conversion and the 3-3-1 model with doubly charged bileptons. We show that the constraint on the mass of the vector bilepton obtained by experimental data can be evaded even in the minimal version of the model since there are other contributions to that conversion. We also discuss the condition for which the experimental data constraint is valid. ©2000 The American Physical Society.

On the regularization of mixed complementarity problems

A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable inexact solutions of the strictly monotone MCP's is bounded and every accumulation point is a solution. Under an additional condition on the precision used for solving each subproblem, the sequence converges to the minimum norm solution of the MCP. Copyright © 2000 by Marcel Dekker, Inc.

Invex nonsmooth alternative theorem and applications

An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion's approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.

Cohomology in the pure spinor formalism for the superstring

A manifestly super-Poincaré covariant formalism for the superstring has recently been constructed using a pure spinor variable. Unlike the covariant Green-Schwarz formalism, this new formalism is easily quantized with a BRST operator and tree-level scattering amplitudes have been evaluated in a manifestly covariant manner. In this paper, the cohomology of the BRST operator in the pure spinor formalism is shown to give the usual light-cone Green-Schwarz spectrum. Although the BRST operator does not directly involve the Virasoro constraint, this constraint emerges after expressing the pure spinor variable in terms of SO(8) variables.

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.

Lower bound to the mass of a relativistic three-boson system in the lightcone

The lower bound masses of the ground-state relativistic three-boson system in 1 + 1, 2 + 1 and 3 + 1 spacetime dimensions are obtained. We have considered a reduction of the ladder Bethe-Salpeter equation to the lightfront in a model with renormalized two-body contact interaction. The lower bounds are deduced with the constraint of reality of the two-boson subsystem mass. It is verified that, in some cases, the lower bound approaches the ground-state binding energy. The corresponding non-relativistic limits are also verified.

Interference phenomena, chiral bosons, and Lorentz invariance

We have studied the theory of gauged chiral bosons and proposed a general theory, a master action, that encompasses different kinds of gauge field couplings in chiral bosonized theories with first-class chiral constraints. We have fused opposite chiral aspects of this master action using the soldering formalism and applied the final action to several well-known models. The Lorentz rotation permitted us to fix conditions on the parameters of this general theory in order to preserve the relativistic invariance. We also have established some conditions on the arbitrary parameter concerned in a chiral Schwinger model with a generalized constraint, investigating both covariance and Lorentz invariance. The results obtained supplement the one that shows the soldering formalism as a new method of mass generation. ©2001 The American Physical Society.

A new solution to the optimal power flow problem

A new approach to solving the Optimal Power Flow problem is described, making use of some recent findings, especially in the area of primal-dual methods for complex programming. In this approach, equality constraints are handled by Newton's method inequality constraints for voltage and transformer taps by the logarithmic barrier method and the other inequality constraints by the augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. © 2001 IEEE.

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.