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 58 for “"Nonconvexity"”.

  1. Confounding and nonconvexity in the analysis of spatial data

    … or global, where models on a sphere are used; nonconvexity due to the shape of domains has attracted less attention. We first analyze the problem of spatial confounding in linear models, giving a unified account of what conditions are necessary to guarantee the consistency of traditional …

    jhu Repository record for Confounding and nonconvexity in the analysis of spatial data (opens in a new tab) Embargoed until 2027-05-01

  2. ON RICCATI EQUATIONS IN NONCONVEX OPTIMIZATION

    … or methods lacking worst-case guarantees. Nonconvexity does not always invalidate the intuition and methods developed for convex problems, especially when especially when some of the structures leading to convexity remain intact. It is often possible to preserve feasibility through …

    penn Repository record for ON RICCATI EQUATIONS IN NONCONVEX OPTIMIZATION (opens in a new tab)

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

  4. Nonconvex Optimization Methods: Iteration Complexity And Applications

    … in many fields. Despite the hardness of nonconvexity, a large number of these applications are dealing with nonconvex optimization problems. In this thesis, we shall focus on several different aspects of nonconvex optimization algorithms and their complexity results, including the …

    umn Repository record for Nonconvex Optimization Methods: Iteration Complexity And Applications (opens in a new tab)

  5. A novel approach to process debottlenecking and intensification: integrated techniques for targeting and design

    … the debottlenecking. Because of the general nonconvexity of the process model, a rigorous interval-based bounding technique is used to determine the target for maximum extent of debottlenecking aside from the problem nonconvexity. Inclusion isotonicity using interval arithmetic is used to …

    tamu Repository record for A novel approach to process debottlenecking and intensification: integrated techniques for targeting and design (opens in a new tab)

  6. Nonconvex Dynamical Problems

    … to nonlinear partial differential equations. The nonconvexity of their underlying energy potential is a challenge for mathematical analysis, since convexity plays an important role in the classical theories of existence and regularity. In the last years one main point of interest was to develop …

    qucosa-diss

  7. Dois enfoques para a resolução do problema de agrupamento

    … avoids the problem of non-differentiability and nonconvexity in their continuous relaxation. And the relevance of these new approaches are consolidated through the computational results developed as comparative experiments to show the strength of the proposed models in contrast to other known and …

    brazil-uerj Repository record for Dois enfoques para a resolução do problema de agrupamento (opens in a new tab)

  8. Learning models in quantum computation and quantum control

    … sequence, and numerically find that, despite the nonconvexity of the loss landscape, gradient descent always converges to the target unitary when the sequence contains d<sup>2</sup> or more parameters. Third, we introduce the first quantum boosting algorithm for converting a weak quantum learner …

    oxford Repository record for Learning models in quantum computation and quantum control (opens in a new tab)

  9. A Lagrangean Relaxation and A Heuristic for the Pooling Problem

    … input streams. Specifically, nonlinearity and nonconvexity are due to the use of bilinear terms either in the quality constraints or in the objective function. Nonlinearity and nonconvexity result in several local optima, making the process of solving large-scale pooling problems to global …

    waterloo Repository record for A Lagrangean Relaxation and A Heuristic for the Pooling Problem (opens in a new tab)

  10. MULTIVARIATE PROBABILITY DENSITY ESTIMATION USING PIECEWISE AFFINE FUNCTIONS

    … The results indicate progress in moderating the nonconvexity challenge to optimize the likelihood, and demonstrate potential advantages over currently used methods.

    nps Repository record for MULTIVARIATE PROBABILITY DENSITY ESTIMATION USING PIECEWISE AFFINE FUNCTIONS (opens in a new tab)

  11. A nonlinear switched-capacitor network for edge detection in early vision

    … the network to perform the graduated nonconvexity algorithm. A high-level functional network simulation was used to verify the correct operation of the GNC algorithm. A one-dimensional six node CMOS VLSI test chip was designed, simulated and submitted for fabrication.

    ubc Repository record for A nonlinear switched-capacitor network for edge detection in early vision (opens in a new tab) Download PDF for A nonlinear switched-capacitor network for edge detection in early vision (opens in a new tab)

  12. Global optimization methods for optimal power flow and transmission switching problems in electric power systems

    … use of several different strategies to handle nonconvexity, including conic relaxations, envelopes, disjunctive extended formulations, cutting planes, variable bound tightening techniques and feasibility heuristics. Our approaches scale well to large power systems problems and provide provably …

    gatech Repository record for Global optimization methods for optimal power flow and transmission switching problems in electric power systems (opens in a new tab)

  13. A methodology for solving the network toll design problem

    … are very difficult to solve because of the nonconvexity and nondifferentiability of the constraint set. In this dissertation, the problem is converted into a single level, standard nonlinear optimization problem by making certain simplifying assumption. This single-level version of the toll …

    njit Repository record for A methodology for solving the network toll design problem (opens in a new tab)

  14. Structural Optimization Using Geometric Programming and the Integrated Formulation

    … a nonlinear problem, i.e., nonconvergence due to nonconvexity. The method presented here first isolates a convex subset of the possibly nonconvexfeasible region. The Generalized Geometric Programming method generates a series of such convex regions that converge to a solution of the overall …

    uiuc Repository record for Structural Optimization Using Geometric Programming and the Integrated Formulation (opens in a new tab)

  15. Optimization-based motion planning and obstacle avoidance for autonomous driving and racing

    … challenge of obstacle avoidance is the inherent nonconvexity, which, for example, involves the decision of overtaking left or right. Relying purely on discrete planning is burdened by the high-dimensional planning space and suffers from the curse of dimensionality. Mixed-integer optimization …

    freiburg-diss Repository record for Optimization-based motion planning and obstacle avoidance for autonomous driving and racing (opens in a new tab)

  16. Asymptotic Cones of Quadratically Defined Sets and Their Applications to QCQPs

    … QCQPs cover a diverse set of problems, but the nonconvexity and unboundedness of quadratic constraints lead to difficulties in globally solving a QCQP. This thesis covers properties of unbounded quadratic constraints via a description of the asymptotic cone of a set defined by a single quadratic …

    clemson Repository record for Asymptotic Cones of Quadratically Defined Sets and Their Applications to QCQPs (opens in a new tab)

  17. Renewable Energy Integration in Distribution System with Artificial Intelligence

    … forecasting for the network reconfiguration. The nonconvexity of three-phase balanced optimal power flow is relaxed to an optimal power flow (OPF) problem with the second-order cone program (SOCP). The alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in …

    denver Repository record for Renewable Energy Integration in Distribution System with Artificial Intelligence (opens in a new tab)

  18. A study of relatively weakly convex optimization models and their extensions

    … property, and exhibit overall nonsmoothness and nonconvexity. By leveraging the structure of relatively weakly convex functions and utilizing the framework of the stochastic variants of the models, in this thesis we develop and analyze a suite of Bregman-based proximal algorithms, including the …

    umn Repository record for A study of relatively weakly convex optimization models and their extensions (opens in a new tab)

  19. Global Well-Posedness of Nonlocal Differential Equations Arising from Traffic Flow

    … of smooth classical solutions for all time). The nonconvexity of the flux and the structure of the nonlocal contribution distinguish these traffic flow models as unique within the context of existing literature. By establishing regularity criteria for each model and studying their behavior in the …

    south-carolina Repository record for Global Well-Posedness of Nonlocal Differential Equations Arising from Traffic Flow (opens in a new tab)

Page 1 of 3