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 “"convex models"”.

  1. NONSMOOTH NONCONVEX OPTIMIZATION AND ROBUST CONVEX MODELS

    … combining theoretical advances in nonsmooth nonconvex algorithms and applied models for decision-making under uncertainty, emphasizing both rigor and applicability. In nonsmooth nonconvex optimization, stochastic gradient methods are widely used but lack finite-time complexity guarantees. A …

    cornell Repository record for NONSMOOTH NONCONVEX OPTIMIZATION AND ROBUST CONVEX MODELS (opens in a new tab)

  2. FAST RATE ANALYSIS OF STOCHASTIC OPTIMIZATION IN STATISTICAL ESTIMATION

    … then in the training phase, parameters in these models are tuned using optimization algorithm. Optimization approaches have enjoyed prominence in machine learning because of their wide applicability and attractive theoretical properties. On the other hand, the increasing complexity of machine …

    nus Repository record for FAST RATE ANALYSIS OF STOCHASTIC OPTIMIZATION IN STATISTICAL ESTIMATION (opens in a new tab) Download file for FAST RATE ANALYSIS OF STOCHASTIC OPTIMIZATION IN STATISTICAL ESTIMATION (opens in a new tab)

  3. Higher-order inference in conditional random fields using submodular functions

    … random fields (CRFs) are expressive graphical models which have been very successful in low-level computer vision applications such as semantic segmentation, and stereo matching. These models are able to capture long-range interactions and higher-order image statistics much better than pairwise …

    oxford Repository record for Higher-order inference in conditional random fields using submodular functions (opens in a new tab)

  4. Fast and Scalable Power System Learning, Analysis, and Planning

    … of a group of devices with uncertainties and non-convex models can be captured with a quadratic classifier and using that classifier we can design a virtual battery model that best describes the aggregate flexibility. For power system analysis and planning, we have addressed fast probabilistic …

    vt Repository record for Fast and Scalable Power System Learning, Analysis, and Planning (opens in a new tab)

  5. Convex Optimization and Utility Theory: New Trends in VLSI Circuit Layout

    … for the placement subtask, we propose new convex programming formulations to estimate wirelength and force cells to spread within the placement area. As opposed to previous approaches, our approach is partitioning free and requires no hard constraints to achieve cell spreading within the …

    waterloo Repository record for Convex Optimization and Utility Theory: New Trends in VLSI Circuit Layout (opens in a new tab)

  6. Robust algorithms on low-rank approximation and their applications

    Low-rank approximation models have been widely developed in computer vision, image analysis, signal processing, web data analysis, bioinformatics, etc. Generally, we assume that the intrinsic data lies in a low-dimensional subspace, and we need to extract the low-rank representation given …

    msu Repository record for Robust algorithms on low-rank approximation and their applications (opens in a new tab)

  7. Interval elastoplastic analysis of structures

    … The uncertainties are modeled as intervals (or convex models), which are deterministic but lie within known upper and lower bound ranges. The analysis determines the most maximum and the most minimum values of some specified (e.g. displacement at some location) variable. The proposed scheme uses …

    unsw Repository record for Interval elastoplastic analysis of structures (opens in a new tab)

  8. Non-convex and Interactive Learning via Stochastic Optimization

    … developing state-of-the-art image classification models to defeating the world champion in the game of Go. From statistical learning (e.g. image recognition) to interactive learning (e.g. the game of Go), this success is primarily driven by a shift towards using over-parameterized non-convex …

    cornell Repository record for Non-convex and Interactive Learning via Stochastic Optimization (opens in a new tab)

  9. Optimizing Sustainable Product Development

    … processes, this thesis presents three models for sustainable product development. All models consider environmental issues and cost for the whole life cycle of the product, from the extraction of raw materials to the end of life of the product. Three group of customer requirements are …

    concordia Download PDF for Optimizing Sustainable Product Development (opens in a new tab)

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

  11. Mitigating Disruption Risks in Supply Chain Financing and Railway Transportation

    … is introduced to solve the proposed non-convex models. A case study involving Ford Motor Company and a Chicago-based retailer enriches the research with real-world context. The findings offer several managerial insights: the strategic advantages of different insurance services vary based …

    mcmaster Repository record for Mitigating Disruption Risks in Supply Chain Financing and Railway Transportation (opens in a new tab)

  12. OPTIMIZATION ALGORITHMS USING PRIORS IN COMPUTER VISION

    Over the years, many computer vision models, some inspired by human behavior, have been developed for various applications. However, only handful of them are popular and widely used. Why? There are two major factors: 1) most of these models do not have any efficient numerical algorithm and hence …

    maryland Repository record for OPTIMIZATION ALGORITHMS USING PRIORS IN COMPUTER VISION (opens in a new tab)

  13. A new scheme for the optimum design of stiffened composite panels with geometric imperfections

    … methodology in which a manufacturing model and a convex model for uncertainties are used in conjunction with a nonlinear design tool in order to obtain a more realistic, better performing final design. First a finite element code for the nonlinear postbuckling analysis of stiffened panels is …

    vt Repository record for A new scheme for the optimum design of stiffened composite panels with geometric imperfections (opens in a new tab)

  14. Novel convex optimization techniques for circuit analysis and synthesis

    … circuit analysis, optimization, and synthesis. Convex optimization is a special class of mathematical optimization problems which minimize convex functions over convex sets. For general optimization problems, finding a local minimum is often easier than finding a global optimal. The inherent …

    texas Repository record for Novel convex optimization techniques for circuit analysis and synthesis (opens in a new tab)