Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Polynomial programming"”.

  1. New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems

    Polynomial programming, a class of non-linear programming where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the past decade. Polynomial programming is a powerful modeling tool that captures various optimization models. Due to …

    waterloo Repository record for New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems (opens in a new tab)

  2. Covering relaxation methods for solving the zero-one positive polynomial programming problem

    … by Granot et al for solving positive 0-1 polynomial programming (PP) problems which maximize a linear objective function in 0-1 variables subject to a set of polynomial inequalities containing only positive coefficients ["Covering Relaxation for Positive 0-1 Polynomial Programs", …

    ubc Repository record for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab) Download PDF for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab)

  3. Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques

    … Technique (RLT)-based linear programming (LP) relaxations for solving nonconvex polynomial programming problems, through the generation of valid inequalities and reduced representations, along with the design and implementation of efficient algorithms. We first conduct a …

    vt Repository record for Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques (opens in a new tab)

  4. Polynomial and indefinite quadratic programming problems: algorithms and applications

    … is concerned with the global optimization of polynomial programming problems, and a detailed treatment of its particular special case, the indefinite quadratic programming problem. Polynomial programming problems are generally nonconvex, involving the optimization of a polynomial objective …

    vt Repository record for Polynomial and indefinite quadratic programming problems: algorithms and applications (opens in a new tab)

  5. Solving Factorable Programs with Applications to Cluster Analysis, Risk Management, and Control Systems Design

    … the advent of the simplex algorithm, linear programming (LP) has been extensively used with great success in many diverse fields. The field of discrete optimization came to the forefront as a result of the impressive developments in the area of linear programming. Although discrete …

    vt Repository record for Solving Factorable Programs with Applications to Cluster Analysis, Risk Management, and Control Systems Design (opens in a new tab)

  6. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.

    … branch-and-bound scheme on a family of separable polynomial programming problems. Finally, we study an important class of monotonic optimization problems | probabilistically constrained linear programs. We develop a branch-and-bound algorithm that searches for a global solution to the problem. The …

    gatech Repository record for Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. (opens in a new tab)

  7. Global Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique

    … two approaches based on employing a sequence of polynomial programming approximations, each within two alternative branch-and-bound frameworks. In the first approach, we construct a polynomial programming approximation to the containership design problem using the Response Surface Methodology …

    vt Repository record for Global Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique (opens in a new tab)

  8. Dynamical System Decomposition and Analysis Using Convex Optimization

    … theory and is computationally implemented using polynomial programming techniques. The main result of this work is the development of a system decomposition framework that makes it possible to analyze systems that are of such a scale that traditional methods cannot cope with.</p> <p>We begin by …

    oxford Repository record for Dynamical System Decomposition and Analysis Using Convex Optimization (opens in a new tab)

  9. A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems

    … continuous relaxations spanning from the linear programming relaxation to the convex hull representation for linear mixed integer 0-1 problems, and is particularly designed to exploit explicit or implicit special structures defined by the constraints of a problem. Specifically, inherent special …

    vt Repository record for A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems (opens in a new tab)

  10. On the identifiability of highly parameterised models of physical processes

    … this as- sessment as an algebraic problem, using polynomial programming techniques. The result is an algorithm that produces parameter-dependent algebraic functions that are guaranteed to bound user-defined aspects of model behaviour over parameter space.</p> <p>We then consider more general …

    oxford Repository record for On the identifiability of highly parameterised models of physical processes (opens in a new tab)

  11. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems

    … algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible region that is …

    vt Repository record for Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems (opens in a new tab)

  12. Optimal Collision Avoidance Maneuvers for Safe Spacecraft Operations

    … theCAMproblem is cast as an energy-optimal polynomial program (PP): in this instance, differential algebra (DA) is leveraged to high orders – typically between 2 and 5 – to automatically express any constraint as a Taylor polynomial in the control variables. The PP is efficiently solved by …

    auckland-ms Repository record for Optimal Collision Avoidance Maneuvers for Safe Spacecraft Operations (opens in a new tab)

  13. Geometry of Optimization in Markov Decision Processes and Neural Network-Based PDE Solvers

    … observable Markov decision processes by polynomial inequalities. In particular, the optimization problem in partially observable MDPs is described as a polynomially constrained linear objective program that generalizes the (dual) linear programming formulation of fully observable …

    qucosa-diss