Searcharxiv⌕ Search

arXiv subjects

Yousong Luo

Publications and source records attributed to Yousong Luo.

10 recordsLinked to original sources
arXiv2017

Exact recursive updating of uncertainty sets

This paper addresses the classical problem of determining the set of possible states of a linear discrete-time system subject to bounded disturbances from measurements corrupted by bounded noise. These so-called uncertainty sets evolve with time as new measurements become available. We present two theorems which describe completely how they evolve with time, and this yields an efficient algorithm for recursively updating uncertainty sets. Numerical simulations demonstrate performance improvements over existing exact methods.

math.OC↗
arXiv2017

Exact recursive updating of uncertainty sets for discrete-time plants with a lag

In a recent paper [arXiv:1612.04918] there are new results concerning the polytopic set of possible states of a linear discrete-time SISO system subject to bounded disturbances from measurements corrupted by bounded noise. Using these results we construct an algorithm which, for the special case of a plant with a lag, recursively updates these polytopic sets when new measurements arrive.

math.OC↗
arXiv2015

The U-Lagrangian of a prox-regular function

When restricted to a subspace, a nonsmooth function can be differentiable. It is known that for a nonsmooth convex function f and a point x, the Euclidean space can be decomposed into two subspaces: U, over which a special Lagrangian can be defined and has nice smooth properties and V, the orthogonal complement subspace of U. In this paper we generalize the definition of UV-decomposition and U-Lagrangian to the context of nonconvex functions, specifically that of a prox-regular function.

math.OC↗
arXiv2015

A version of bundle method with linear programming

Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each iteration. In this paper, we exploit the feasibility of developing a bundle algorithm that only solves linear subproblems. We start from minimization of a convex function and show that the sequence of major iterations converge to a minimizer. For nonconvex functions we consider functions that are locally Lipschitz continuous and prox-regular on a bounded level set, and minimize the cutting-plane model over a trust region with infinity norm. The para-convexity of such functions allows us to use the locally convexified model and its convexity properties. Under some conditions and assumptions, we study the convergence of the proposed algorithm through the outer semicontinuity of the proximal mapping. Encouraging results of preliminary numerical experiments on standard test sets are provided.

math.OC↗
arXiv2014

Companion Matrices and Their Relations to Toeplitz and Hankel Matrices

In this paper we describe some properties of companion matrices and demonstrate some special patterns that arise when a Toeplitz or a Hankel matrix is multiplied by a related companion matrix. We present a new condition, generalizing known results, for a Toeplitz or a Hankel matrix to be the transforming matrix for a similarity between a pair of companion matrices. A special case of our main result shows that a Toeplitz or a Hankel matrix can be extended using associated companion matrices, preserving the Toeplitz or Hankel structure respectively.

math.GM↗
arXiv2014

Optimal Venttsel Boundary Control of Parabolic Equations

In this paper we study the optimality condition for the Venttsel boundary control of a parabolic equation, that is, the state of the dynamic system is governed by a parabolic equation together with an initial condition while the control is applied to the system via the Venttsel boundary condition. A first order necessary condition is derived for the optimal solution in the case of both unconstrained and constrained problems. The condition is also sufficient for the unconstrained problem.

math.AP↗
arXiv2014

Exact recursive estimation of linear systems subject to bounded disturbances

This paper addresses the classical problem of determining the sets of possible states of a linear discrete-time system subject to bounded disturbances from measurements corrupted by bounded noise. These so-called uncertainty sets evolve with time as new measurements become available. We present an exact, computationally simple procedure that propagates a point on the boundary of the uncertainty set at some time instant to a set of points on the boundary of the uncertainty set at the next time instant.

math.OC↗
arXiv2009

Necessary Optimality Conditions for Some Control Problems of Elliptic Equations with Venttsel Boundary Conditions

In this paper we derive a necessary optimality condition for a local optimal solution of some control problems. These optimal control problems are governed by a semi-linear Vettsel boundary value problem of a linear elliptic equation. The control is applied to the state equation via the boundary and a functional of the control together with the solution of the state equation under such a control will be minimized. A constrain on the solution of the state equation is also considered.

math.AP↗