Other Topics

A novel elitist multiobjective optimization algorithm: multiobjective extremal optimization

  • Min-Rong Chen
  • Yong-Zai Lu
    • Categories Approximation Algorithms, Meta Heuristics, Multi-Criteria Optimization

    Recently, a general-purpose local-search heuristic method called Extremal Optimization (EO) has been successfully applied to some NP-hard combinatorial optimization problems. This paper presents an investigation on EO with its application in multiobjective optimization and proposes a new novel elitist multiobjective algorithm, called Multiobjective Extremal Optimization (MOEO). In order to extend EO to solve the multiobjective … Read more

    Measures with zeros in the inverse of their moment matrix

  • J. William Helton
  • Jean-Bernard Lasserre
  • M. Putinar
    • Categories Other Topics, Statistics

    We investigate and discuss when the inverse of a multivariate truncated moment matrix of a measure has zeros in some prescribed entries. We describe precisely which pattern of these zeroes corresponds to independence, namely, the measure having a product structure. A more refined finding is that the key factor forcing a zero entry in this … Read more

    Multi-objective branch-and-bound. Application to the bi-objective spanning tree problem.

  • Francis Sourd
  • Olivier Spanjaard
    • Categories Multi-Criteria Optimization

    This paper focuses on a multi-objective derivation of branch-and-bound procedures. Such a procedure aims to provide the set of Pareto optimal solutions of a multi-objective combinatorial optimization problem. Unlike previous works on this issue, the bounding is performed here via a set of points rather than a single ideal point. The main idea is that … Read more

    Sufficient Conditions for a Real Polynomial to be a Sum of Squares

  • Jean-Bernard Lasserre
    • Categories Global Optimization Theory, Linear Programming, Other Topics

    We provide explicit sufficient conditions for a polynomial $f$ to be a sum of squares (s.o.s.), linear in the coefficients of $f$. All conditions are simple and provide an explicit description of a convex polyhedral subcone of the cone of s.o.s. polynomials of degree at most $2d$. We also provide a simple condition to ensure … Read more

    The Impact of Collusion on the Price of Anarchy in Nonatomic and Discrete Network Games

  • Tobias Harks
    • Categories Game Theory, Network Optimization, Transportation Tags , , ,

    Hayrapetyan, Tardos and Wexler recently introduced a framework to study the impact of collusion in congestion games on the quality of Nash equilibria. We adopt their framework to network games and focus on the well established price of anarchy as a measure of this impact. We first investigate nonatomic network games with coalitions. For this … Read more

    Sensitivity analysis in linear semi-infinite programming via partitions

  • Miguel A. Goberna
  • Tamás Terlaky
  • Maxim I. Todorov
    • Categories Other Topics, Semi-infinite Programming Tags , , ,

    This paper provides sufficient conditions for the optimal value function of a given linear semi-infinite programming problem to depend linearly on the size of the perturbations, when these perturbations are directional, involve either the cost coefficients or the right-hand-side function or both, and they are sufficiently small. Two kinds of partitions are considered. The first … Read more

    CONVERGENCE OF A CLASS OF SEMI-IMPLICIT TIME-STEPPING SCHEMES FOR NONSMOOTH RIGID MULTIBODY DYNAMICS

  • Mihai Anitescu
  • Florian A. Potra
  • Bogdan Gavrea
    • Categories Complementarity and Variational Inequalities, Mechanical Engineering, Other Topics Tags , , , ,

    In this work we present a framework for the convergence analysis in a measure differential inclusion sense of a class of time-stepping schemes for multibody dynamics with contacts, joints, and friction. This class of methods solves one linear complementarity problem per step and contains the semi-implicit Euler method, as well as trapezoidallike methods for which … Read more

    A new adaptive algorithm for linear multiobjective programming problems

  • M.O. Bibi
  • M.S Radjef
  • Sonia Radjef
    • Categories Linear, Cone and Semidefinite Programming, Multi-Criteria Optimization Tags , , , , , ,

    In this paper, we present a new adaptive algorithm for defining the solution set of a multiobjective linear programming problem, where the decision variables are upper and lower bounded, using the direct support method. The principle particularitie of this method is the fact that it handles the bounds of variables such are they are initially … Read more

    Decentralized Decision-making and Protocol Design for Recycled Material Flows

  • Jane Ammons
  • I-Hsuan Hong
  • Matthew Realff
    • Categories Game Theory, Production and Logistics, Robust Optimization

    Reverse logistics networks often consist of several tiers with independent members competing at each tier. This paper develops a methodology to examine the individual entity behavior in reverse production systems where every entity acts to maximize its own benefits. We consider two tiers in the network, collectors and processors. The collectors determine individual flow functions … Read more

    A Q-Learning Algorithm with Continuous State Space

  • Kengy Barty
  • Pierre Girardeau
  • Jean-Sebastien Roy
  • Cyrille Strugarek
    • Categories Dynamic Programming, Stochastic Programming Tags , ,

    We study in this paper a Markov Decision Problem (MDP) with continuous state space and discrete decision variables. We propose an extension of the Q-learning algorithm introduced to solve this problem by Watkins in 1989 for completely discrete MDPs. Our algorithm relies on stochastic approximation and functional estimation, and uses kernels to locally update the … Read more