Loading...

Table of Content

    30 September 2013, Volume 1 Issue 3
    Continuous Optimization
    Optimal Control of Nonlinear Switched Systems: Computational Methods and Applications
    Qun Lin · Ryan Loxton · Kok Lay Teo
    2013, 1(3):  275-312.  doi:10.1007/s40305-013-0021-z
    Asbtract ( 724 )   PDF (1123KB) ( 642 )  
    Related Articles | Metrics

    A switched system is a dynamic system that operates by switching between
    different subsystems or modes. Such systems exhibit both continuous and discrete
    characteristics—a dual nature that makes designing effective control policies a challenging
    task. The purpose of this paper is to review some of the latest computational
    techniques for generating optimal control laws for switched systems with nonlinear
    dynamics and continuous inequality constraints.We discuss computational strategies
    for optimizing both the times at which a switched system switches from one mode to
    another (the so-called switching times) and the sequence in which a switched system
    operates its various possible modes (the so-called switching sequence). These strategies
    involve novel combinations of the control parameterization method, the timescaling
    transformation, and bilevel programming and binary relaxation techniques.
    We conclude the paper by discussing a number of switched system optimal control
    models arising in practical applications.

    An Approximation Bound Analysis for Lasserre’s Relaxation in Multivariate Polynomial Optimization
    Jia-Wang Nie
    2013, 1(3):  313-332.  doi:10.1007/s40305-013-0017-8
    Asbtract ( 282 )   PDF  
    Related Articles | Metrics

    Suppose f, g1, ··· ,gm are multivariate polynomials in x ∈ Rn and their
    degrees are at most 2d. Consider the problem:
    Minimize f (x) subject to g1(x)  0, ··· ,gm(x)  0.
    Let fmin (resp., fmax) be the minimum (resp., maximum) of f on the feasible set S,
    and fsos be the lower bound of fmin given by Lasserre’s relaxation of order d. This
    paper studies its approximation bound. Under a suitable condition on g1, ··· ,gm, we
    prove that
    (fmax −fsos)  Q(fmax − fmin)
    with Q a constant depending only on g1, ··· ,gm but not on f . In particular, if S is
    the unit ball, Q = O(nd ); if S is the hypercube, Q = O(n2d ); if S is the boolean set,
    Q= O(nd ).

    A Note on Legendre–Fenchel Conjugate of the Product of Two Positive-Definite Quadratic Forms
    Yong Xia
    2013, 1(3):  333-338.  doi:10.1007/s40305-013-0018-7
    Asbtract ( 289 )   PDF  
    Related Articles | Metrics

    The Legendre–Fenchel conjugate of the product of two positive-definite
    quadratic forms was posted as an open question in the field of nonlinear analysis and
    optimization by Hiriart-Urruty [‘Question 11’ in SIAM Review 49, 255–273, 2007].
    Under a convexity assumption on the function, it was answered by Zhao [SIAM J.
    Matrix Analysis & Applications 31(4), 1792–1811, 2010]. In this note, we answer
    the open question without making the convexity assumption.

    Stochastic Optimization
    An Approximation Algorithm for the Risk-Adjusted Two-Stage Stochastic Facility Location Problem with Penalties
    Jia-Ting Shao · Da-Chuan Xu
    2013, 1(3):  339-346.  doi:10.1007/s40305-013-0020-0
    Asbtract ( 312 )   PDF (379KB) ( 213 )  
    Related Articles | Metrics

    In this paper, we consider the risk-adjusted two-stage stochastic facility
    location problem with penalties (RSFLPP). Using the monotonicity and positive
    homogeneity of the risk measure function, we present an LP-rounding-based
    6-approximation algorithm.

    Discrete Optimization
    On the Eigenvalues of General Sum-Connectivity Laplacian Matrix
    Han-Yuan Deng · He Huang · Jie Zhang
    2013, 1(3):  347-358.  doi:10.1007/s40305-013-0022-y
    Asbtract ( 358 )   PDF  
    Related Articles | Metrics

    The connectivity index was introduced by Randi´c (J. Am. Chem. Soc.
    97(23):6609–6615, 1975) and was generalized by Bollobás and Erdös (Ars Comb.
    50:225–233, 1998). It studies the branching property of graphs, and has been applied
    to studying network structures. In this paper we focus on the general sum-connectivity
    index which is a variant of the connectivity index.We characterize the tight upper and
    lower bounds of the largest eigenvalue of the general sum-connectivity matrix, as well
    as its spectral diameter. We show the corresponding extremal graphs. In addition, we
    show that the general sum-connectivity index is determined by the eigenvalues of the
    general sum-connectivity Laplacian matrix.

    Continuous Optimization
    A Large-Update Feasible Interior-Point Algorithm for Convex Quadratic Semi-definite Optimization Based on a New Kernel Function
    B. Kheirfam · F. Hasani
    2013, 1(3):  359-376.  doi:10.1007/s40305-013-0023-x
    Asbtract ( 286 )   PDF (597KB) ( 68 )  
    Related Articles | Metrics

    In this paper we present a large-update primal-dual interior-point algorithm
    for convex quadratic semi-definite optimization problems based on a new parametric
    kernel function. The goal of this paper is to investigate such a kernel function and
    show that the algorithm has the best complexity bound. The complexity bound is
    shown to be O(√n log n log n
     ).

    Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time
    Cu-Xia Miao · Yun-Jie Xia · Yu-Zhong Zhang · Juan Zou
    2013, 1(3):  377-384.  doi:10.1007/s40305-013-0019-6
    Asbtract ( 306 )   PDF  
    Related Articles | Metrics

    We consider bounded parallel-batch scheduling with proportional-linear
    deteriorating jobs and the objective to minimize the total completion time. We give
    some properties of optimal schedules for the problem and present for it a dynamic
    programming algorithm running in O(b2m22m) time, where b is the size of a batch
    and m is the number of distinct deterioration rates.

    Discrete Optimization
    On the Mixed Minus Domination in Graphs
    Bao-Gen Xu · Xiang-Yang Kong
    2013, 1(3):  385-392.  doi:10.1007/s40305-013-0024-9
    Asbtract ( 292 )   PDF (311KB) ( 106 )  
    Related Articles | Metrics

    Let G = (V ,E) be a graph, for an element x ∈ V ∪E, the open total neighborhood
    of x is denoted by Nt (x) = {y|y is adjacent to x or y is incident with x,y ∈
    V ∪ E}, and Nt [x] = Nt (x) ∪ {x} is the closed one. A function f : V (G) ∪ E(G)→
    {−1, 0, 1} is said to be a mixed minus domination function (TMDF) of G if
    y∈Nt [x] f (y)  1 holds for all x ∈ V (G) ∪ E(G). The mixed minus domination
    number γ  tm(G) of G is defined as
    γ  tm(G) = min
     
    x∈V ∪E
    f (x)|f is a TMDF of G
    
    .
    In this paper, we obtain some lower bounds of the mixed minus domination number
    of G and give the exact values of γ  tm(G) when G is a cycle or a path.

    Wiener Index of Graphs and Their Line Graphs
    Xiao-Hai Su · Li-GongWang · Yun Gao
    2013, 1(3):  393-404.  doi:10.1007/s40305-013-0027-6
    Asbtract ( 306 )   PDF (496KB) ( 90 )  
    Related Articles | Metrics

    TheWiener index W(G) of a graphGis a distance-based topological index
    defined as the sum of distances between all pairs of vertices in G. It is shown that for
    λ = 2 there is an infinite family of planar bipartite chemical graphs G of girth 4
    with the cyclomatic number λ, but their line graphs are not chemical graphs, and
    for λ  2 there are two infinite families of planar nonbipartite graphs G of girth 3
    with the cyclomatic number λ; the three classes of graphs have the property W(G) =
    W(L(G)), where L(G) is the line graph of G.

    Computational Complexity of a Solution for Directed Graph Cooperative Games
    Ayumi Igarashi · Yoshitsugu Yamamoto
    2013, 1(3):  405-414.  doi:10.1007/s40305-013-0025-8
    Asbtract ( 307 )   PDF (413KB) ( 95 )  
    Related Articles | Metrics

    Khmelnitskaya et al. have recently proposed the average covering tree
    value as a new solution concept for cooperative transferable utility games with directed
    graph structure. The average covering tree value is defined as the average of
    marginal contribution vectors corresponding to the specific set of rooted trees, and coincides
    with the Shapley value when the game has complete communication structure.
    In this paper, we discuss the computational complexity of the average covering tree
    value. We show that computation of the average covering tree value is #P-complete
    even if the characteristic function of the game is {0, 1}-valued. We prove this by a
    reduction from counting the number of all linear extensions of a partial order, which
    has been shown by Brightwell et al. to be a #P-complete counting problem. The implication
    of this result is that an efficient algorithm to calculate the average covering
    tree value is unlikely to exist.

    Stochastic Optimization
    Analysis of Stationary Queue Length Distribution for Geo/T-IPH/1 Queue
    Hong-Bo Zhang · Zhen-Ting Hou · Ding-Hua Shi
    2013, 1(3):  415-424.  doi:10.1007/s40305-013-0026-7
    Asbtract ( 278 )   PDF (433KB) ( 162 )  
    Related Articles | Metrics

    In this paper we study a Geo/T-IPH/1 queue model, where T-IPH denotes
    the discrete time phase type distribution defined on a birth-and-death process with
    countably many states. The queue model can be described by a quasi-birth-anddeath
    (QBD) process with countably phases. Using the operator-geometric solution
    method, we first give the expression of the operator and the joint stationary distribution.
    Then we obtain the probability generating function (PGF) for stationary queue
    length distribution and sojourn time distribution, respectively.