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 15 of 15 for “"nonconvex programming"”.

  1. New Rigorous Decomposition Methods for Mixed-integer Linear and Nonlinear Programming

    … stochastic mixed-integer linear and nonlinear (nonconvex) programming (MILP and MINLP) problems. These problems, with a scenario based formulation, lead to large-scale MILPs/MINLPs that are well structured. The first part of the thesis proposes a new finitely convergent cross decomposition …

    queens Repository record for New Rigorous Decomposition Methods for Mixed-integer Linear and Nonlinear Programming (opens in a new tab)

  2. Optimization of control device locations and sizes in mine ventilation systems

    … problem is formulated through a nonlinear nonconvex programming model. Using the special ordered sets variables, the nonconvex problem is linearized and then optimized by the modified branch and bound procedure where the automatic interpolation technique is used to improve the accuracy to …

    vt Repository record for Optimization of control device locations and sizes in mine ventilation systems (opens in a new tab)

  3. Optimal scheduling of hydro-thermal power generation systems

    … manifests itself as a large scale mixed integer programming problem. In the first instance a linear model is built and solved using branch-and-bound. This approach is, however, very expensive in terms of computational time. Using Lagrangian relaxation the original primal problem may be written in …

    strathclyde Repository record for Optimal scheduling of hydro-thermal power generation systems (opens in a new tab)

  4. Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems

    … research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and …

    vt Repository record for Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems (opens in a new tab)

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

    … optimization 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 …

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

  6. Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications

    <p>Acceleration in optimization is a term that is generally applied to optimization algorithms presenting some common methodology that enjoy convergence rates that improve over other more simple algorithms for the same problem. For example, Nesterov's Accelerated Gradient Descent improves over the …

    oxford Repository record for Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications (opens in a new tab)

  7. Dimensionality reduction techniques for global optimization

    <p>Though ubiquitous in applications, global optimisation problems are generally the most computationally intense due to their solution time growing exponentially with linear increase in their dimensions (this is the well known/so called ‘curse of dimensionality’). In this thesis, we show that this …

    oxford Repository record for Dimensionality reduction techniques for global optimization (opens in a new tab)

  8. Mixed integer programming approaches for nonlinear and stochastic programming

    In this thesis we study how to solve some nonconvex optimization problems by using methods that capitalize on the success of Linear Programming (LP) based solvers for Mixed Integer Linear Programming (MILP). A common aspect of our solution approaches is the use, development and analysis of small …

    gatech Repository record for Mixed integer programming approaches for nonlinear and stochastic programming (opens in a new tab)

  9. Video Communications over Dynamic Ad Hoc Networks

    … paths. This problem is formulated as a nonlinear nonconvex programming problem, for which a tight linear programming relaxation is constructed via the Reformulation-Linearization Technique (RLT). This construct is embedded within a specialized branch-and-bound algorithm to achieve global …

    vt Repository record for Video Communications over Dynamic Ad Hoc Networks (opens in a new tab)

  10. Computing multiple solutions of topology optimization problems

    … in a PDE, volume and inequality constrained, nonconvex, infinite-dimensional optimization problem. These problems can exhibit many local minima. In practice, heuristics are used to aid the search for better minima, but these can fail even in the simplest of cases.</p> <p>In this thesis we …

    oxford Repository record for Computing multiple solutions of topology optimization problems (opens in a new tab)

  11. A Nonsmooth Nonconvex Descent Algorithm

    In many applications nonsmooth nonconvex energy functions, which are Lipschitz continuous, appear quite naturally. Contact mechanics with friction is a classic example. A second example is the 1-Laplace operator and its eigenfunctions. In this work we will give an algorithm such that for every …

    qucosa-diss