31 research outputs found
Invariance Conditions for Nonlinear Dynamical Systems
Recently, Horv\'ath, Song, and Terlaky [\emph{A novel unified approach to
invariance condition of dynamical system, submitted to Applied Mathematics and
Computation}] proposed a novel unified approach to study, i.e., invariance
conditions, sufficient and necessary conditions, under which some convex sets
are invariant sets for linear dynamical systems.
In this paper, by utilizing analogous methodology, we generalize the results
for nonlinear dynamical systems. First, the Theorems of Alternatives, i.e., the
nonlinear Farkas lemma and the \emph{S}-lemma, together with Nagumo's Theorem
are utilized to derive invariance conditions for discrete and continuous
systems. Only standard assumptions are needed to establish invariance of
broadly used convex sets, including polyhedral and ellipsoidal sets. Second, we
establish an optimization framework to computationally verify the derived
invariance conditions. Finally, we derive analogous invariance conditions
without any conditions
Strong duality in conic linear programming: facial reduction and extended duals
The facial reduction algorithm of Borwein and Wolkowicz and the extended dual
of Ramana provide a strong dual for the conic linear program in the absence of any constraint qualification. The facial
reduction algorithm solves a sequence of auxiliary optimization problems to
obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite
program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz
showed that these approaches are closely related; in particular, they proved
the correctness of Ramana's dual using certificates from a facial reduction
algorithm.
Here we give a clear and self-contained exposition of facial reduction, of
extended duals, and generalize Ramana's dual:
-- we state a simple facial reduction algorithm and prove its correctness;
and
-- building on this algorithm we construct a family of extended duals when
is a {\em nice} cone. This class of cones includes the semidefinite cone
and other important cones.Comment: A previous version of this paper appeared as "A simple derivation of
a facial reduction algorithm and extended dual systems", technical report,
Columbia University, 2000, available from
http://www.unc.edu/~pataki/papers/fr.pdf Jonfest, a conference in honor of
Jonathan Borwein's 60th birthday, 201
A dynamic inequality generation scheme for polynomial programming
Hierarchies of semidefinite programs have been used to approximate or even solve polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small size. In this paper, we propose a dynamic inequality generation scheme to generate valid polynomial inequalities for general polynomial programs. When used iteratively, this scheme improves the bounds without incurring an exponential growth in the size of the relaxation. As a result, the proposed scheme is in principle scalable to large general polynomial programming problems. When all the variables of the problem are non-negative or when all the variables are binary, the general algorithm is specialized to a more efficient algorithm. In the case of binary polynomial programs, we show special cases for which the proposed scheme converges to the global optimal solution. We also present several examples illustrating the computational behavior of the scheme and provide comparisons with Lasserre’s approach and, for the binary linear case, with the lift-and-project method of Balas, Ceria, and Cornuejols
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
Semidefinite programming has been used successfully to build hierarchies of convex relaxations to approximate polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small sizes. We propose an iterative scheme that improves the semidefinite relaxations without incurring exponential growth in their size. The key ingredient is a dynamic scheme for generating valid polynomial inequalities for general polynomial programs. These valid inequalities are then used to construct better approximations of the original problem. As a result, the proposed scheme is in principle scalable to large general combinatorial optimization problems. For binary polynomial programs, we prove that the proposed scheme converges to the global optimal solution for interesting cases of the initial approximation of the problem. We also present examples illustrating the computational behaviour of the scheme and compare it to other methods in the literature
Review on computational methods for Lyapunov functions
Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ di_erent methods such as series expansion, linear programming, linear matrix inequalities, collocation methods, algebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function
Duality in Risk Aggregation
A fundamental problem in risk management is the robust aggregation of different sources of risk in a situation where little or no data are available to infer information about their dependencies. A popular approach to solving this problem is to formulate an optimization problem under which one maximizes a risk measure over all multivariate distributions that are consistent with the available data. In several special cases of such models, there exist dual problems that are easier to solve or approximate, yielding robust bounds on the aggregated risk. In this chapter, we formulate a general optimization problem, which can be seen as a doubly infinite linear programming problem, and we show that the associated dual generalizes several well-known special cases and extends to new risk management models we propose