Characterization of well-posedness of piecewise linear systems

One of the basic issues in the study of hybrid systems is the well-posedness (existence and uniqueness of solutions) problem of discontinuous dynamical systems. The paper addresses this problem for a class of piecewise-linear discontinuous systems under the definition of solutions of Caratheodory. The concepts of jump solutions or of sliding modes are not considered here. In this sense, the problem to be discussed is one of the most basic problems in the study of well-posedness for discontinuous dynamical systems. First, we derive necessary and sufficient conditions for bimodal systems to be well-posed, in terms of an analysis based on lexicographic inequalities and the smooth continuation property of solutions. Next, its extensions to the multimodal case are discussed. As an application to switching control, in the case that two state feedback gains are switched according to a criterion depending on the state, we give a characterization of all admissible state feedback gains for which the closed loop system remains well-pose

Continuation method for nonlinear complementarity problems via normal maps

Cataloged from PDF version of article.In a recent paper by Chen and Mangasarian (C. Chen, O.L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems, Computational Optimization and Applications 2 (1996), 97±138) a class of parametric smoothing functions has been proposed to approximate the plus function present in many optimization and complementarity related problems. This paper uses these smoothing functions to approximate the normal map formulation of nonlinear complementarity problems (NCP). Properties of the smoothing function are investigated based on the density functions that de®nes the smooth approximations. A continuation method is then proposed to solve the NCPs arising from the approximations. Su cient conditions are provided to guarantee the boundedness of the solution trajectory. Furthermore, the structure of the subproblems arising in the proposed continuation method is analyzed for di erent choices of smoothing functions. Computational results of the continuation method are reported. Ó 1999 Elsevier Science B.V. All rights reserved

A convex analysis approach to optimal controls with switching structure for partial differential equations

Optimal control problems involving hybrid binary-continuous control costs are challenging due to their lack of convexity and weak lower semicontinuity. Replacing such costs with their convex relaxation leads to a primal-dual optimality system that allows an explicit pointwise characterization and whose Moreau-Yosida regularization is amenable to a semismooth Newton method in function space. This approach is especially suited for computing switching controls for partial differential equations. In this case, the optimality gap between the original functional and its relaxation can be estimated and shown to be zero for controls with switching structure. Numerical examples illustrate the effectiveness of this approach

Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems

A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem. The algorithm achieves linear global convergence and quadratic local convergence under the following assumptions: the function satisfies a modified scaled Lipschitz condition, the problem has a strictly complementary solution, and certain submatrix of the Jacobian is nonsingular on some compact set

Using EPECs to model bilevel games in restructured electricity markets with locational prices

CWPE0619 (EPRG0602) Xinmin Hu and Daniel Ralph (Feb 2006) Using EPECs to model bilevel games in restructured electricity markets with locational prices We study a bilevel noncooperative game-theoretic model of electricity markets with locational marginal prices. Each player faces a bilevel optimization problem that we remodel as a mathematical program with equilibrium constraints, MPEC. This gives an EPEC, equilibrium problem with equilibrium constraints. We establish sufficient conditions for existence of pure strategy Nash equilibria for this class of bilevel games and give some applications. We show by examples the effect of network transmission limits, i.e. congestion, on existence of equilibria. Then we study, for more general EPECs, the weaker pure strategy concepts of local Nash and Nash stationary equilibria. We model the latter via complementarity problems, CPs. Finally, we present numerical examples of methods that attempt to find local Nash or Nash stationary equilibria of randomly generated electricity market games. The CP solver PATH is found to be rather effective in this context