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 20 of 61 for “"Convex Relaxations"”.

  1. Convex relaxations for cubic polynomial problems

    … bound. A theoretical study on the properties of convex underestimators for non-linear terms which are quadratic in one of the variables and linear on the other variable is presented. A new underestimator is introduced for this class of terms. The final part of the thesis describes the numerical …

    gatech Repository record for Convex relaxations for cubic polynomial problems (opens in a new tab)

  2. Strong lower bounds on generic convex relaxations

    … scheme based on SDP that extends natural LP relaxations and spectral methods, captures the best approximation algorithms for fundamental problems and is the prime candidate for refuting the Unique Games Conjecture. Further, we show that any sub-exponential algorithm based on the …

    texas Repository record for Strong lower bounds on generic convex relaxations (opens in a new tab)

  3. Convex relaxations of the maximin dispersion problem

    Recently, convex relaxations have achieved notable success in solving NP-hard optimization problems. This thesis studies semidefinite and second-order cone programming convex relaxations of the maximin dispersion problem. Providing nontrivial approximation bounds, we believe that our SDP and SOCP …

    ubc Repository record for Convex relaxations of the maximin dispersion problem (opens in a new tab) Download PDF for Convex relaxations of the maximin dispersion problem (opens in a new tab)

  4. Analysis of Convex Relaxations for Nonconvex Optimization

    Nonconvex optimizations are ubiquitous in many application fields. One important aspect of dealing with a nonconvex optimization problem is to study its convex relaxation, which is often part of some approximation algorithms that can find quality solutions to the original nonconvex problem. In this …

    cornell Repository record for Analysis of Convex Relaxations for Nonconvex Optimization (opens in a new tab)

  5. Strong convex relaxations for quadratically constrained quadratic programs

    … the next three chapters of the thesis, we study convexification of sets related to the quadratically constrained quadratic program (QCQP). This is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving …

    gatech Repository record for Strong convex relaxations for quadratically constrained quadratic programs (opens in a new tab)

  6. Sensitivity Analysis of Convex Relaxations for Nonsmooth Global Optimization

    … integration. In terms of numerical approaches, convex/concave relaxations of static and dynamic systems may also exhibit nonsmoothness. These relaxations are used in deterministic methods for global optimization. This thesis presents several new theoretical results for nonsmooth sensitivity …

    mcmaster Repository record for Sensitivity Analysis of Convex Relaxations for Nonsmooth Global Optimization (opens in a new tab)

  7. Computational Methods for Computer Vision : Minimal Solvers and Convex Relaxations

    … constraints are in general difficult. Recently convex relaxations, such as the nuclear norm, have been used to make these problems tractable. In this thesis we present new convex relaxations for rank-based optimization which avoid drawbacks of previous approaches and provide tighter relaxations. …

    lund Repository record for Computational Methods for Computer Vision : Minimal Solvers and Convex Relaxations (opens in a new tab) Download PDF for Computational Methods for Computer Vision : Minimal Solvers and Convex Relaxations (opens in a new tab)

  8. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems

    … research has been devoted to finding <I>good</I> relaxations for these hard problems. Usually a <I>good</I> relaxation is one which can be solved (either exactly or within a prescribed numerical tolerance) in polynomial-time. Nesterov and Nemirovskii showed that by this criterion, many convex …

    waterloo Repository record for New Convex Relaxations for the Maximum Cut and VLSI Layout Problems (opens in a new tab)

  9. Convex relaxations of a continuum aggregation model, and their efficient numerical solution

    … more difficult since the Helmholtz energy is nonconvex and nonlocal. Instead of minimizing the original nonconvex functional, the approach in this dissertation is to find minimizers to a convex lower bound functional. The so-called relaxed problem consists of a linear variational problem with an …

    njit Repository record for Convex relaxations of a continuum aggregation model, and their efficient numerical solution (opens in a new tab)

  10. Advanced Convex Relaxations for Nonconvex Stochastic Programs and AC Optimal Power Flow

    … models of practical interest are often nonconvex, large-scale, and uncertain. All of these factors severely complicate the solution of these problems and make it much more difficult to locate true global solutions rather than inferior local solutions. The new algorithms developed in this …

    gatech Repository record for Advanced Convex Relaxations for Nonconvex Stochastic Programs and AC Optimal Power Flow (opens in a new tab)

  11. Convex Relaxations for Particle-Gradient Flow with Applications in Super-Resolution Single-Molecule Localization Microscopy

    Single-molecule localization microscopy (SMLM) techniques have become advanced bioanalytical tools by quantifying the positions and orientations of molecules in space and time at the nanoscale. With the noisy and heterogeneous nature of SMLM datasets in mind, we discuss leveraging particle-gradient …

    wustl Repository record for Convex Relaxations for Particle-Gradient Flow with Applications in Super-Resolution Single-Molecule Localization Microscopy (opens in a new tab)

  12. Multi-timescale Volt/VAR optimization with battery energy storage using convex relaxations in smart distribution grids

    … volt/VAR optimization problem, which is a nonconvex problem. Although metaheuristic algorithms usually achieve good results, they do not provide theoretical guarantee of global optimum. Next, the thesis focuses on the tractable convex relaxations such as semidefinite and second-order cone …

    unsw Repository record for Multi-timescale Volt/VAR optimization with battery energy storage using convex relaxations in smart distribution grids (opens in a new tab)

  13. Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction

    … uses nuclear norm minimization to construct a convex relaxation of the planted bicluster detection problem, with recovery guarantees when the planted subgraph size scales as the logarithm of the network raised to the 1.5 power. The second introduces a nonconvex quadratic programming formulation …

    alabama Repository record for Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction (opens in a new tab)

  14. Bounding Reachable Sets for Global Dynamic Optimization

    … for providing these bounds is to generate convex relaxations of the dynamic system and minimize them using a local optimization solver. Tighter convex relaxations typically lead to tighter lower bounds, so that the number of iterations in global optimization algorithms can be reduced. To …

    mcmaster Repository record for Bounding Reachable Sets for Global Dynamic Optimization (opens in a new tab)

  15. New Bounding Methods for Global Dynamic Optimization

    … These bounds are typically constructed using convex relaxations for the solutions of dynamic systems with respect to decision variables. Tighter convex relaxations thus translate into tighter lower bounds, which will typically reduce the number of iterations required by branch-and-bound. …

    mcmaster Repository record for New Bounding Methods for Global Dynamic Optimization (opens in a new tab)

  16. Rank Reduction with Convex Constraints

    … problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. Traditional model reduction techniques try to minimize …

    lund Repository record for Rank Reduction with Convex Constraints (opens in a new tab) Download PDF for Rank Reduction with Convex Constraints (opens in a new tab)

  17. Cardinality Constrained Optimization Problems

    … constraints are hard to solve due to their nonconvexity. We focus on constructing tight convex relaxations to such problems.

    purdue-thes Repository record for Cardinality Constrained Optimization Problems (opens in a new tab)

  18. Variational and convex approximations of 1-dimensional optimal networks and hyperbolic obstacle problems

    … side, we provide variational approximations and convex relaxations of the relevant energies and dynamics, moving mainly within the framework of Gamma-convergence and of convex analysis. On the other side, we thoroughly investigate the numerical optimization of the corresponding approximating …

    trento Repository record for Variational and convex approximations of 1-dimensional optimal networks and hyperbolic obstacle problems (opens in a new tab)

Page 1 of 4