arXiv subjects

Qin Ba

Publications and source records attributed to Qin Ba.

3 recordsLinked to original sources

arXiv2018

Exact Penalization of Generalized Nash Equilibrium Problems

This paper presents an exact penalization theory of the generalized Nash equilibrium problem (GNEP) that has its origin from the renowned Arrow-Debreu general economic equilibrium model. While the latter model is the foundation of much of mathematical economics, the GNEP provides a mathematical model of multi-agent non-cooperative competition that has found many contemporary applications in diverse engineering domains. The most salient feature of the GNEP that distinguishes it from a standard non-cooperative (Nash) game is that each player's optimization problem contains constraints that couple all players' decision variables. Extending results for stand-alone optimization problems, the penalization theory aims to convert the GNEP into a game of the standard kind without the coupled constraints, which is known to be more readily amenable to solution methods and analysis. Starting with an illustrative example to motivate the development, the paper focuses on two kinds of coupled constraints, shared (i.e., common) and finitely representable. Constraint residual functions and the associated error bound theory play an important role throughout the development.

cs.GT↗

arXiv2017

Computing Optimal Control of Cascading Failure in DC Networks

We consider discrete-time dynamics, for cascading failure in DC networks, whose map is composition of failure rule with control actions. Supply-demand at the nodes is monotonically non-increasing under admissible control. Under the failure rule, a link is removed permanently if its flow exceeds capacity constraints. We consider finite horizon optimal control to steer the network from an arbitrary initial state, defined in terms of active link set and supply-demand at the nodes, to a feasible state, i.e., a state which is invariant under the failure rule. There is no running cost and the reward associated with a feasible terminal state is the associated cumulative supply-demand. We propose two approaches for computing optimal control. The first approach, geared towards tree reducible networks, decomposes the global problem into a system of coupled local problems, which can be solved to optimality in two iterations. When restricted to the class of one-shot control actions, the optimal solutions to the local problems possess a piecewise affine property, which facilitates analytical solution. The second approach computes optimal control by searching over the reachable set, which is shown to admit an equivalent finite representation by aggregation of control actions leading to the same reachable active link set. An algorithmic procedure to construct this representation is provided by leveraging and extending tools for arrangement of hyperplanes and polytopes. Illustrative simulations, including showing the effectiveness of a projection-based approximation algorithm, are also presented.

eess.SY↗

arXiv2016

Robustness of DC Power Networks under Weight Control

We study, possibly distributed, robust weight control policies for DC power networks that change link susceptances, or weights in response to balanced disturbances to the supply-demand vector. The margin of robustness for a given control policy is defined as the radius of the largest $l_1$ ball in the space of balanced disturbances under which the link flows can be asymptotically contained within their specified limits. For centralized control policies, the control design as well as margin of robustness are obtained from solution to an non-convex weight control problem. We establish relationship between feasible sets for DC power flow and associated network flow, which is used to establish an upper bound on the margin of robustness in terms of the min cut capacity. This bound is proven to be tight if the network is tree-like, or if the lower bound of the operation range of weight control is zero. An explicit expression for the flow-weight Jacobian is derived and is used to devise a projected sub-gradient algorithm to solve the relaxed weight control problem. An exact multi-level programming approach to solve the weight control problem for reducible networks, based on recursive application of equivalent bilevel formulation for relevant class of non-convex network optimization problems, is also proposed. The lower level problem in each recursion corresponds to replacing a sub-network by a (virtual) link with equivalent weight and capacities. The equivalent capacity function for tree-reducible networks is shown to possess a strong quasi-concavity property, facilitating easy solution to the weight control problem. Robustness analysis for natural decentralized control policies that decrease weights on overloaded links, and increase weights on underloaded links with increasing flows is provided for parallel networks. Illustrative simulation results for a benchmark IEEE network are included.

math.OC↗