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 115 for “"Convex Relaxation"”.

  1. A convex relaxation approach to set-membership identification

    … data sequence. Such problems are generally nonconvex and NP-hard. Therefore, standard nonlinear optimization tools can not be used to compute parameter bounds, since they can trap in local minima and, as a consequence, the computed bounds are not guaranteed to contain the true values of …

    poli-torino Repository record for A convex relaxation approach to set-membership identification (opens in a new tab)

  2. Convex relaxation methods in optimisation and robust control

    … to the largest singular value of M. Two relaxations are considered to simplify the problem. A randomised algorithm is proposed which relies on the partial enumeration of the Zonotope’s vertices for high dimensional problems when the complete enumeration may not be practical. Applying this …

    city-london Download PDF for Convex relaxation methods in optimisation and robust control (opens in a new tab)

  3. Convex Relaxation Methods For Optimal Electromagnetic Actuator Placement

    Microrobots have significant potential for minimally invasive medicine, since they can access regions of the body that are difficult to reach using conventional instruments. Among the available actuation methods, magnetic actuation is especially attractive because it can remotely exert forces and …

    mcmaster Repository record for Convex Relaxation Methods For Optimal Electromagnetic Actuator Placement (opens in a new tab)

  4. Power System Optimization Methods: Convex Relaxation and Benders Decomposition

    … and implementation of two optimization methods: Convex relaxation and Benders' decomposition. The first part of the dissertation focuses on the application of convex relaxation to solve Alternating Current Optimal Power Flow (ACOPF) problems. In the completed work, a 3-node cycle based sparse …

    usf Repository record for Power System Optimization Methods: Convex Relaxation and Benders Decomposition (opens in a new tab)

  5. Convex relaxation based locational marginal prices for electricity markets

    We propose and analyze semidefinite relaxation-based locational marginal prices (RLMPs) for real and reactive power in electricity markets. Our analysis reveals that when the nonconvex economic dispatch problem has zero duality gap, the RLMPs exhibit properties similar to locational marginal prices …

    uiuc Repository record for Convex relaxation based locational marginal prices for electricity markets (opens in a new tab)

  6. Convex relaxation for the planted clique, biclique, and clustering problems

    … as rank minimization problems and relaxed to convex programming by replacing rank with its convex envelope, the nuclear norm. Both problems are NP-hard yet we show that our relaxation is exact in the case that the input graph contains a large clique or biclique plus additional nodes and edges. …

    waterloo Repository record for Convex relaxation for the planted clique, biclique, and clustering problems (opens in a new tab)

  7. Combinatorial methods for compressed sensing

    … Two extreme approaches for those decoders are convex relaxation and combinatorial methods. The former approach requires the least number of samples for an exact reconstruction at the price of high complexities while the latter approach has low complexities but requires a higher number of …

    msu

  8. 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)

  9. Unit commitment : tight formulation and pricing

    … as generation expansion planning (GEP). The non-convex costs associated with the commitment decisions may also lead to generators' incentive to deviate from the optimal dispatch under locational marginal prices. In this dissertation, we first propose a convex relaxation of UC based on a primal …

    texas Repository record for Unit commitment : tight formulation and pricing (opens in a new tab)

  10. Topics in sparse approximation

    … for sparse approximation: greedy methods and convex relaxation methods. Greedy methods make a sequence of locally optimal choices in an effort to obtain a globally optimal solution. Convex relaxation methods replace the combinatorial sparse approximation problem with a related convex …

    texas Repository record for Topics in sparse approximation (opens in a new tab)

  11. Convergence of K-indicators Clustering with Alternating Projection Algorithms

    … on the idea of subspace matching and a semi-convex relaxation scheme, outperforms k-means in many aspects, such as no random replication and insensitivity to initialization. Unlike k-means, empirical evidence suggests that KindAP can correctly identify well-separated globular clusters even …

    rice Repository record for Convergence of K-indicators Clustering with Alternating Projection Algorithms (opens in a new tab)

  12. 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)

  13. A Convergent Hierarchy of Certificates for Constrained Signomial Positivity

    … that of the original problem. Specifically, convex optimization problems are often efficiently solvable, and finding a convex formulation that approximates a nonconvex problem, known as convex relaxation, is an effective approach. This work concerns a particular class of optimization problem, …

    waterloo Repository record for A Convergent Hierarchy of Certificates for Constrained Signomial Positivity (opens in a new tab)

  14. Data-driven Methods for Optimal Power Flow in Smart Grids

    … supply and demand. However, traditional OPF and convex relaxation methods often face issues related to feasibility and computational speed. Recently, machine learning methods have gained considerable attention as potential solutions to these challenges. As discussed in the literature, these …

    york Repository record for Data-driven Methods for Optimal Power Flow in Smart Grids (opens in a new tab)

  15. Convex and nonconvex optimization geometries

    … signal processing problems are fundamentally nonconvex. One way to solve them is to transform them into convex optimization problems (a.k.a. convex relaxation), which constitutes a major part of my research. Although the convex relaxation approach is elegant in some ways that it can give …

    colo-mines Repository record for Convex and nonconvex optimization geometries (opens in a new tab)

  16. Collaborative ranking from ordinal data

    … thesis presents a matrix factorization inspired, convex relaxation algorithm to collaboratively learn hidden preferences of users through the multinomial logit (MNL) model, a discrete choice model. It also shows that the algorithm is efficient in terms of the number of observations needed.

    uiuc Repository record for Collaborative ranking from ordinal data (opens in a new tab)

  17. Chemical Logistics

    … optima. Multilinear problems are chiefly nonconvex in nature. The need for convex relaxation of such functions is essential to combat the infeasibilities generated by them owing to such nonconvexities. We address an effective technique for generating the tightest convex relaxation of …

    nus Repository record for Chemical Logistics (opens in a new tab) Download file for Chemical Logistics (opens in a new tab)

  18. Algorithm design for optimal power flow, security-constrained unit commitment, and demand response in energy systems

    … power flow (OPF) in ac-dc grids, which is a non-convex optimization problem. We use convex relaxation techniques and transform the problem into a semidefinite program (SDP). We derive the sufficient conditions for zero relaxation gap and design an algorithm to obtain the global optimal solution. …

    ubc Repository record for Algorithm design for optimal power flow, security-constrained unit commitment, and demand response in energy systems (opens in a new tab) Download PDF for Algorithm design for optimal power flow, security-constrained unit commitment, and demand response in energy systems (opens in a new tab)

  19. Automated and verified deep learning

    … of an adversarial example. This non-convex problem is commonly approximated with a convex relaxation. We make two important contributions in this direction. First, we propose a specialised dual solver for a new convex relaxation. This was essential because although the relaxation is …

    oxford Repository record for Automated and verified deep learning (opens in a new tab)

  20. Privacy-Preserving Decentralized Optimization and Event Localization

    … N agents cooperatively minimize the sum of N convex functions private to these individual agents. In most existing decentralized optimization approaches, participating agents exchange and disclose states explicitly, which may not be desirable when the states contain sensitive information of …

    clemson Repository record for Privacy-Preserving Decentralized Optimization and Event Localization (opens in a new tab)

Page 1 of 6