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 45 for “"constrained optimization problem"”.
-
Algorithms for a constrained optimization problem with applications in statistics and optimum design
Abstract available: p.3-5
-
Fluid surface reconstruction from particles
Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained …
-
Optimization algorithms in compressive sensing (CS) sparse magnetic resonance imaging (MRI)
… reconstruction involves solving a nonlinear constrained optimization problem. The reduction of reconstruction time in MRI is of signi cant bene t. We reformulate sparse MRI reconstruction as a Second Order Cone Program (SOCP).We also explore two alternative techniques to solving the SOCP …
-
Applications and Extensions of Quadratic Signal Representations
… representation is obtained as the solution to a constrained-optimization problem. The optimization problem can be solved using a gradient-projection technique. The consistent TFR demonstrates superior performance compared to existing techniques on a variety of test signals as well as on actual …
-
A novel optimization formulation for the direct computation of the voltage collapse point
… of a certain power system is formulated as a constrained optimization problem which is solved using a robust scheme known as the Dog-leg Trust Region. This technique is mainly characterized by its reliability and fast convergence as it makes advantage of the merits of classical optimization …
-
Robust Control of Stochastic Nonlinear Systems
The third topic studied involves the constrained minimax optimization problem for a class of stochastic nonlinear systems in strict-feedback form, where in addition to the standard Wiener process there is a norm-bounded unknown disturbance driving the system. The bound on the disturbance is a …
-
Mutual information based tracking with mobile sensors
… mobile sensor nodes in a sensing and estimation problem, one must carefully consider the optimal placement of those sensor nodes and simultaneously account for the cost incurred in moving the sensor nodes. We present an approximate dynamic programming approach to a tracking problem with mobile …
-
Optimizing the Allocation of Capital Among Offensive Positions in the NFL
… By framing the allocation challenge as a constrained optimization problem, we aim to help teams maximize their points per game while staying within the salary cap limit. Our model’s predictions enable us to identify the optimal distribution of resources across offensive positions, …
-
Efficient Numerical Methods for Initial Value Control Problems for Diffeomorphic Image Registration
… this represents an infinite-dimensional, inverse problem. We formulate diffeomorphic image registration as a partial differential equation constrained optimization problem. The partial differential equations enter the formulation as equality constraints. We consider hyperbolic transport equations …
-
Dynamic sensor tasking in heterogeneous, mobile sensor networks
… modes, power costs and other salient features. Optimization in this environment requires considering all possible sensor modalities and combinations. Additionally, in many cases there may be a time critical objective, requiring sensor plans to be developed and refined in real-time. This research …
-
A Variational Approach to Estimating Uncertain Parameters in Elliptic Systems
… approach to solve the stochastic inverse problem of obtaining a statistical description of the diffusion coefficient in an elliptic partial differential equation, based noisy measurements of the model output. We formulate the parameter identification problem as an infinite dimensional …
-
Optimization Based Domain Decomposition Methods for Linear and Nonlinear Problems
Optimization based domain decomposition methods for the solution of partial differential equations are considered. The crux of the method is a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the common boundaries between …
-
Performance analysis and resource allocation in CDMA wireless networks for multimedia services
… Given the multimedia user requirements, the problem addressed can be formulated as a constrained optimization problem. The objective of the admission control and resource allocation policy is to determine the channel allocation to the users with the corresponding feasible power and rate …
-
Numerical methods for optimization problems in water flow and reactive solute transport processes of xenobiotics in soils
… fields: 1. Modeling of parameter estimation problems and optimal experimental design problems: Mathematical modeling of water and solute transport processes in the unsaturated zone leads to instationary partial differential equations (PDEs) coupled with nonlinear ordinary differential …
-
The fundamental limits of statistical data privacy
… tradeoff. This tradeoff is formulated as a constrained optimization problem: maximize utility subject to differential privacy constraints. We show, perhaps surprisingly, that in all three privacy contexts, the optimal privacy mechanisms have the same combinatorial staircase structure. This …
-
Significance of battery energy storage systems in mitigating the challenges in weak grids
… have proved effective in mitigating numerous problems caused by the high penetration of RESs. However, planning BESSs is an extremely important task, not only because of high costs of batteries, but also because misplacing BESSs can have a negative impact on grid reliability. This thesis has …
-
Perfect Recovery in Heterogeneous Stochastic Bicluster Models
… We model this as the densest k-disjoint-biclique problem, in which a weighted complete bipartite graph is partitioned into k disjoint subgraphs to maximize the sum of their densities. In our first solution approach, we show that underlying bicliques can be recovered with high probability by …
-
A game-theoretic approach to the security of emerging cognitive radio and small cell networks
… formulations for and investigate a number of problems that arise in the security of some emerging wireless technologies. First, we address the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple …
-
Developments in topology and shape optimization
… parts: a gradient-based parameter-free shape optimization method; a stress-constrained topology optimization; and a wave tailoring topology optimization. In shape optimization, the independent node movement approach, wherein finite element node coordinates are used directly as design …
-
A Computational Framework for Assessing and Optimizing the Performance of Observational Networks in 4D-Var Data Assimilation
… observations. The sensor network configuration problem is formulated as a meta-optimization problem. Best values for parameters such as sensor location are obtained by optimizing a performance criterion, subject to the constraint posed by the 4D-Var optimization. Tractable computational …
Page 1 of 3