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 23 for “"Second Order Cone Program"”.
-
Traffic signal control using queueing theory
… of a queueing system. In this report, SOCPs (second order cone program) are proposed based on different queueing models as pre-timed signal control techniques to minimize total travel delay. Stochastic programs are developed in order to handle the uncertainties in the arrival rates. In …
-
Optimization algorithms in compressive sensing (CS) sparse magnetic resonance imaging (MRI)
… t. We reformulate sparse MRI reconstruction as a Second Order Cone Program (SOCP).We also explore two alternative techniques to solving the SOCP prob- lem directly: NESTA and speci cally designed SOCP-LB.
-
Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty
… as a deterministic optimization problem. The second model is to minimize the WCVaR of regret for the same random combinatorial optimization. For the class of combinatorial optimization problems with a compact convex hull representation, some polynomial sized mixed integer linear program (MILP) …
-
Probabilistic Virtual Network Embedding under Demand Uncertainty
… formulation is proposed and this results in a second-order cone program that can be solved efficiently for large networks. Also, an existing virtual node embedding algorithm augmented by the proposed link embedding solution is used in simulations and experiments to show the utility and …
-
Autonomous Trajectory Planning for Satellite RPO and Safety of Flight Using Convex Optimization
… corridors, and spherical keep-out zones. A second scenario that ensures passive safety, in the event of control failures on the maneuvering satellite. The convex optimization problem is ultimately formulated as a second-order cone program. Algorithm CPU and memory requirements are analyzed. …
-
A Probabilistic Analysis Of Low-Rank Approximations In Optimization Problems With Ellipsoidal Constraints
… with cancer. The problem was formulated as a second-order cone program. Due to the size of the problem, low-rank matrices were used in order to create a computationally tractable approximation. This work is an attempt to theoretically explain the success of low-rank approximations in such …
-
Green Supply Chain Network Design with Emission Sensitive Demand
… supply chain network design literature. In the second part, a two echelon supply chain with emission sensitive demand is considered. A new model is provided that determines at which points investments in lower emitting technologies at the warehouses is necessary. Being nonlinear due to the …
-
Robust Sketch Orchestration in Programmable Networks
… approach for coordinated sketch placement on programmable network devices, such as switches and SmartNICs, without relying on the fixed traffic rate assumption. Instead, we consider scenarios where only statistical information about traffic rates, such as their means and variances, is …
-
Convex relaxations of the maximin dispersion problem
… 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 relaxation methods are useful in large-scale optimization. The thesis is organized as …
-
Optimal deleveraging and liquidation of financial portfolios with market impact
… problem as a non-convex quadratic (polynomial) program with quadratic (polynomial) and box constraints under linear (nonlinear) market price impact functions. A Lagrangian algorithm is developed to numerically solve the NP-hard problem and estimate the quality of the solution. We further propose …
-
Optimal Operation of Water and Power Distribution Networks
… consists of novel mixed-integer (non)-linear program (MINLP) formulations; convex relaxations with optimality guarantees; and the powerful technique of McCormick linearization. On the application side, the developed tools support the operation of each of the infrastructure networks …
-
Classification under input uncertainty with support vector machines
… and the resulting optimisation problem is a second order cone program (SOCP) with a unique solution. Based on the statistical models on the input uncertainty, Bi and Zhang (2005) developed total support vector classification (TSVC), which has a similar geometric interpretation and …
-
Proactive Traffic Sampling with Dynamic Flow Rates in Software-Defined Networks
… Since our initial formulation is an Integer Second Order Cone Program (ISOCP), which is infeasible for both small-scale and large-scale network instances, we shift our focus to developing an efficient approximate Integer Linear Program (ILP) called APX, which can compute sampling allocations …
-
Modeling and Evaluation of Utility-Scale Microgrid Investment for Distribution System Planning
… heightens the complexity of system management. Second, the increased frequency of severe weather events and increased potential for a cybersecurity attack necessitate the need for a resilient infrastructure that can respond adaptively to shutdowns within the system. Microgrids (MGs) present a …
-
Optimal Collision Avoidance Maneuvers for Safe Spacecraft Operations
… The first proposed method is asequential convex program (SCP). The problem is cast as a second-order cone program and solved iteratively via iterative convexification of the constraints and the objective function. The probability of collision (PoC) constraint, pivotal in the design of CAMs, is …
-
Planning and Operations with Decision-Dependent Uncertainty in Power Systems: Equity-Aware Charging and Wildfire Resilience
… and formulate the problem as a mixed-integer second-order cone program to minimize total cost, including charging equipment investment, power facility upgrades, and grid operation. To explicitly address transit equity, we introduce a fairness metric, the Regional Proportion of BEB Routes, and …
-
Distributionally robust solution schemes for two-stage optimization and interdiction problems under uncertainty
… can be reformulated as an exact copositive program that admits tractable approximations in semidefinite programming. We then design a decomposition algorithm where smaller-size semidefinite programs can be solved in parallel, which further reduces the runtime. Through numerical examples, we …
-
Renewable Energy Integration in Distribution System with Artificial Intelligence
… 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 distributed manner. Considering the reality of distribution systems, a three-phase unbalanced distribtion system is …
-
Autonomous optimal trajectory design employing convex optimization for powered descent on an asteroid
… are becoming increasingly popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site with pinpoint precision. The problem under investigation is how to design a propellant (fuel) optimal powered descent trajectory that can be …
-
Mixed Integer Quadratic Optimization for Learning Directed Acyclic Graphs from Continuous Data
… data can be cast as a mixed-integer quadratic programming (MIQP) with the objective function as the penalized negative log-likelihood (PNL) and an L0 regularization penalty subject to linear constraints. There are two key challenges: (i) imposing a set of constraints to remove cycles from a …
Page 1 of 2