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 179 for “"Non Convex Optimization"”.

  1. Adaptive strategies in non-convex optimization

    … learning have seen more and more usage of non-convex formulations in that they can often better capture the problem structure. One prominent example is the Deep Neural Networks which have achieved innumerable successes in various fields including computer vision and natural language …

    bu Repository record for Adaptive strategies in non-convex optimization (opens in a new tab)

  2. Provable non-convex optimization for learning parametric models

    Non-convex optimization plays an important role in recent advances of machine learning. A large number of machine learning tasks are performed by solving a non-convex optimization problem, which is generally NP-hard. Heuristics, such as stochastic gradient descent, are employed to solve non-convex …

    texas Repository record for Provable non-convex optimization for learning parametric models (opens in a new tab)

  3. Algorithms and analysis for non-convex optimization problems in machine learning

    … the angle of spectral methods for some important non-convex optimization problems in machine learning. Specifically, we focus on two types of non-convex optimization problems: learning the parameters of latent variable models and learning in deep neural networks. Learning latent variable models is …

    gatech Repository record for Algorithms and analysis for non-convex optimization problems in machine learning (opens in a new tab)

  4. Combatting ill-conditioning and heavy-tailed noise in non-convex optimization

    Ill-conditioning is a major challenge for optimization with first-order methods. This is especially the case for stochastic optimization, where the classical preconditioners - designed to compensate ill-conditioned curvatures - are hard to construct due to the inherent variability of stochastic …

    cornell Repository record for Combatting ill-conditioning and heavy-tailed noise in non-convex optimization (opens in a new tab)

  5. Cooperative Game Theory and Non-convex Optimization Analysis of Spectrum Sharing

    … interactions in the wireless medium can lead to non-convex problems which have been shown to be NP-hard. Techniques must be developed to tackle the optimization problems that arise from wireless network analysis. In this document we focus on analyzing the spectrum sharing problem from two …

    vt Repository record for Cooperative Game Theory and Non-convex Optimization Analysis of Spectrum Sharing (opens in a new tab)

  6. Convex and non-convex optimization using centroid-encoding for visualization, classification, and feature selection

    … learning. This Ph.D. dissertation presents convex and non-convex models suitable for these three tasks. We propose Centroid-Encoder (CE), an autoencoder-based supervised tool for visualizing complex and potentially large, e.g., SUSY with 5 million samples and high-dimensional datasets, e.g., …

    colostate Repository record for Convex and non-convex optimization using centroid-encoding for visualization, classification, and feature selection (opens in a new tab)

  7. Energy efficient and secure wireless communication systems

    … the resource allocation algorithm design as a non-convex optimization problem. By exploiting the properties of fractional programming, the considered non-convex optimization problem is transformed to an equivalent convex optimization problem with a tractable solution, which can be obtained with …

    ubc Repository record for Energy efficient and secure wireless communication systems (opens in a new tab) Download PDF for Energy efficient and secure wireless communication systems (opens in a new tab)

  8. Geometry and algorithms for signal recovery: from convex duality to non-convex formulations

    … scientific applications, and naturally leads to non-linear and non-convex optimization problems that present many interesting mathematical and algorithmic challenges. In this work, we showcase results for three approaches to solving convex and non-convex optimization problems motivated by …

    washington Repository record for Geometry and algorithms for signal recovery: from convex duality to non-convex formulations (opens in a new tab)

  9. Enhancing optimization algorithms for non-convex settings : federated and decentralized learning

    … attention from the machine learning community to non-convex optimization. This thesis focuses on federated and decentralized learning within the framework of non-convex optimization, aiming to deepen the understanding of the field and derive novel results. Specifically, the first part of this work …

    texas Repository record for Enhancing optimization algorithms for non-convex settings : federated and decentralized learning (opens in a new tab)

  10. Power Gain Optimization for Multiple Active Multiple Passive Dipole Antenna Arrays

    … elements to maximize the gain; constitutes a non-convex optimization problem. To circumvent this difficulty, we develop an efficient algorithm that yields close to optimal results which are demonstrated by numerical evaluations and verified with simulations.

    carleton Repository record for Power Gain Optimization for Multiple Active Multiple Passive Dipole Antenna Arrays (opens in a new tab)

  11. Stochastic optimization with decisions truncated by random variables and its applications in operations

    We study stochastic optimization problems with decisions truncated by random variables and its applications in operations management. The technical difficulty of these problems is that the optimization problem is not convex due to the truncation. We develop a transformation technique to convert the …

    uiuc Repository record for Stochastic optimization with decisions truncated by random variables and its applications in operations (opens in a new tab)

  12. Optimization for high-dimensional analysis and estimation in signal processing and machine learning

    … to develop optimality guarantees as well as some optimization-based techniques for the fundamental problems in signal processing and machine learning.In many applications, high-dimensional signals often have a certain concise representation, which is a linear combination of a small number of atoms …

    colo-mines Repository record for Optimization for high-dimensional analysis and estimation in signal processing and machine learning (opens in a new tab)

  13. Design and dispatch optimization of solar power plants with storage

    … In this dissertation, we develop and solve nonlinear, and non-convex optimization models to assist decision makers in the economically-efficient design and dispatch of concentrating and hybrid solar power plants with storage. We first extend a concentrating solar power dispatch optimization …

    colo-mines Repository record for Design and dispatch optimization of solar power plants with storage (opens in a new tab)

  14. Minimum Variance Benchmark and Performance Assessment for PID Controllers

    … variance with the minimum variance (MV) for the non-restricted linear controller. MV describes the most fundamental performance limitation of a system due to time delays or infinite zeros. MV is estimated with-out disturbing the system and just needs the time delay of a process and its …

    auckland-ms Repository record for Minimum Variance Benchmark and Performance Assessment for PID Controllers (opens in a new tab)

  15. Multiple objective control with applications to teleoperation

    … this minimax problem is transformed into a convex optimization problem . In particular, the infinite time problem is shown to be an optimization problem involving linear matrix inequalities. Second, the multiple objective Hoo control problem for SISO systems is studied. Nonsmooth analysis is …

    ubc Repository record for Multiple objective control with applications to teleoperation (opens in a new tab) Download PDF for Multiple objective control with applications to teleoperation (opens in a new tab)

  16. A Fully Decentralized Approach for Solving the Economic Dispatch Problem

    … problem is based on treating the problem as a non-convex optimization problem in which the practical non-convex cost functions are taken into consideration. Formulating the economic dispatch problem as a non-convex optimization problem and finding a better quality solution to this problem has …

    waterloo Repository record for A Fully Decentralized Approach for Solving the Economic Dispatch Problem (opens in a new tab)

Page 1 of 9