«mixed linear complementarity problem»

۱۲۷ نتیجه
  • On a Stochastic Bilevel Programming Problem with Knapsack Constraints

    سند علمی۲۰۰۹Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser

    In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between

  • State space identification of max-plus-linear discrete event systems from input-output data

    سند علمی۲۰۱۲B. De Schutter, V. Verdult

    We present a method to identify the parameters of a state space model for a max-plus-linear discrete event system from input-output sequences. The approach is based on recasting the identification problem as an optimization problem over the solution set of an extended linear comp

  • Complementarity modeling of hybrid systemsA

    سند علمی۱۹۹۷A J Van Der Schaft, J M Schumacher

    A complementarity framework is described for the modeling of certain classes of mixed continuous/discrete dynamical systems. The use of such a framework is well-known for mechanical systems with inequality constraints, but we give a more general formulation which applies for inst

  • A Hybrid Time-Stepping Scheme for Intermittent Contact in Multi-Rigid-Body Dynamics

    سند علمی۲۰۰۸Kishor D. Bhalerao, Kurt S. Anderson, Jeffrey C. Trinkle

    This paper describes a novel method for the modeling of intermittent contact in multi-rigid-body problems. We use a complementarity based time-stepping scheme in Featherstone’s Divide and Conquer framework to efficiently model the unilateral and bilateral constraints in the syste

  • A Recursive Hybrid Time-Stepping Scheme for Intermittent Contact in Multi-Rigid-Body Dynamics

    سند علمی۲۰۰۸Kishor D. Bhalerao, Kurt S. Anderson, Jeffrey C. Trinkle

    This paper describes a novel method for the modeling of intermittent contact in multi-rigid-body problems. We use a complementarity based time-stepping scheme in Featherstone’s Divide and Conquer framework to efficiently model the unilateral and bilateral constraints in the syste

  • Implicit Euler numerical simulations of sliding mode systems

    سند علمی۲۰۰۹Vincent Acary, Bernard Brogliato

    In this report it is shown that the implicit Euler time-discretization of some classes of switching systems with sliding modes, yields a very good stabilization of the trajectory and of its derivative on the sliding surface. Therefore the spurious oscillations which are pointed o

  • A feasible semismooth asymptotically Newton method for mixed complementarity problems

    سند علمی۲۰۰۲Math. Program.Defeng Sun, Robert S. Womersley, Houduo Qi

    Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible methods. However, some MCPs are not well defined outside the feasible region or the equivalent unconst

  • Constraint Fluids Kenneth Bodin , Claude Lacoursière , Martin Servin

    سند علمی۲۰۰۹Kenneth Bodin, Claude Lacoursière, Martin Servin

    We present a fluid simulation method based on Smoothed Particle Hydrodynamics (SPH) in which incompressibility and boundary conditions are enforced using holonomic kinematic constraints on the density. This formulation enables systematic multiphysics integration in which interact

  • [Book Title], Edited by [Editor’s Name]

    سند علمی۲۰۱۰Jian Yao, Shmuel S. Oren, Benjamin F. Hobbs

    Most existing Nash-Cournot models of competition among electricity generators assume that firms behave purely Cournot or Bertrand with respect to transmission decisions by the independent system operator. Such models are unrealistic for markets in which interfaces connecting subn

  • On convex quadratic programs with linear complementarity constraints

    سند علمی۲۰۱۳Comp. Opt. and Appl.Lijie Bai, John E. Mitchell, Jong-Shi Pang

    The paper shows that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a minmax mixed integer formulation by introducing finitely many bi