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.

Higher grading conformal affine Toda theory and (generalized) sine-Gordon/massive Thirring duality

Some properties of the higher grading integrable generalizations of the conformal affine Toda systems are studied. The fields associated to the non-zero grade generators are Dirac spinors. The effective action is written in terms of the Wess-Zumino-Novikov-Witten (WZNW) action associated to an affine Lie algebra, and an off-critical theory is obtained as the result of the spontaneous breakdown of the conformal symmetry. Moreover, the off-critical theory presents a remarkable equivalence between the Noether and topological currents of the model. Related to the off-critical model we define a real and local lagrangian provided some reality conditions are imposed on the fields of the model. This real action model is expected to describe the soliton sector of the original model, and turns out to be the master action from which we uncover the weak-strong phases described by (generalized) massive Thirring and sine-Gordon type models, respectively. The case of any (untwisted) affine Lie algebra furnished with the principal gradation is studied in some detail. The example of s^l(n) (n = 2, 3) is presented explicitly. © SISSA/ISAS 2003.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.