Iterative linear programming solution of convex programs

اسناد مشابه

• Small-Dimensional Linear Programming and Convex Hulls Made Easy

  سند علمی۱۹۹۱Discrete & Computational GeometryRaimund Seidel

  We present two randomized algorithms. One solves linear programs involving m constraints in d variables in expected time O(m). The other constructs convex hulls of n points in Nd, d > 3, in expected time O(nln/2l). In both bounds d is considered to be a constant. In the linear pr

• Iterative Linear Programming Formulation for Routing and Wavelength Assignment in Optical Networks

  سند علمی۲۰۰۰F. GONZÁLEZ

  In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks. Firstly, we propose separate linear programming (LP) formulations for the lightpath routing and the wavelength assignment subproblems. Then, an itera

• Rapid design of system-wide metabolic network modifications using iterative linear programming

  سند علمی۲۰۱۰Laurence Yang, William R. Cluett, Radhakrishnan Mahadevan

  Computationally-aided metabolic engineering is an important, complementary strategy to combinatorial strain design for enhanced biochemical production by microbes. Bilevel optimization problems have been formulated for optimal strain design via reaction removal, activation, and i

• Automatic estimation of decoding parameters using large-margin iterative linear programming

  سند علمی۲۰۰۹INTERSPEECHBrian Kan-Wing Mak, Tom Ko

  The decoding parameters in automatic speech recognition — grammar factor and word insertion penalty — are usually determined by performing a grid search on a development set. Recently, we cast their estimation as a convex optimization problem, and proposed a solution using an ite

• Min-max discriminative training of decoding parameters using iterative linear programming

  سند علمی۲۰۰۸INTERSPEECHBrian Kan-Wing Mak, Tom Ko

  In automatic speech recognition, the decoding parameters — grammar factor and word insertion penalty — are usually handtuned to give the best recognition performance. This paper investigates an automatic procedure to determine their values using an iterative linear programming (L

• Synthesis of Cable Driven Robots' Dynamic Motion with Maximum Load Carrying Capacities: Iterative Linear Programming Approach

  سند علمی۲۰۱۰M. H. Korayem, M. Bamdad

  In this paper, the general dynamic equation of motion of Cable Driven Robots (CDRs) is obtained from Lagrangian formulation. A computational technique is developed for obtaining an optimal trajectory to maximize the dynamic load carrying capacity for a given point-to-point task.