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 19 of 19 for “"Conic optimization"”.
-
Two problems in convex conic optimization
In the first part of the thesis we focus on smallest enclosing ball problem. We implement Nesterova??s smoothing technique and present a new modified back-tracking algorithm to solve the problem.The second part of the thesis is on the generalized convex quadratic semidefinite program (GQSDP). We …
-
Efficient numerical algorithms for large-scale conic optimization
<p><em>Conic optimization</em> has been widely used in many areas, such as machine learning, image processing and automatic control. It usually relies on iterative algorithms to find the optimum numerically. Compared to linear programming and quadratic programming containing only linear …
-
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
… a powerful modeling tool that captures various optimization models. Due to the wide range of applications, a research topic of high interest is the development of computationally efficient algorithms for solving polynomial programs. Even though some solution methodologies are already available …
-
Invariant conic optimization with basis-dependent cones: Scaled diagonally dominant matrices and real *-algebra decomposition
… For other cones that are basis-dependent, if optimization problems over those cones have symmetries one can still change to a symmetry-adapted basis that block diagonalizes the matrix. However, this change of basis generally changes the constraint cone and can change the optimum. In this …
-
p-Cone Optimization with Application to Radiotherapy Planning
… the study of two facets of the so-called p-cone optimization: one methodological and mostly theoretical, while the other applied and computational. Motivated by optimal radiotherapy design for cancer treatment, we investigate the computational hardness of p-cone optimization, namely the …
-
AN INEXACT ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR CONVEX COMPOSITE CONIC PROGRAMMING WITH NONLINEAR CONSTRAINTS
… thesis focuses on a class of convex composite conic optimization problems with nonlinear constraints. In order to obtain some guidance on solving the general nonlinearly constrained convex composite conic programming model, we compare the numerical performance of some existing first order …
-
Complementarity problems, variational inequalities and extended lorentz cones
… we applied our results in game theory and conic optimization problems. We also discussed the positive operators. We showed necessary and sufficient conditions under which a linear operator is a positive operator of extended Lorentz cone. We also showed sufficient and necessary conditions …
-
Digital Filter Design Using Semidefinite Programming
Abstract This thesis explores an optimization based approach to the design problem of digital filters. We show how a digital filter in the form of a discrete linear time-invariant causal system can be characterized by a non-negative trigonometric polynomial, which in turn can be represented by a …
-
Robust portfolio optimization
The Markowitz mean-variance portfolio optimization is a well known and also widely used investment theory in allocating the assets. However, this theory is also familiar with the extremely sensitive outcome by the small changes in the data. Ben-Tal and Nemirovski [3] therefore introduced the robust …
-
Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods
… primal-dual interior-point methods for convex optimization problems. Convex optimization has applications in many fields of engineering and science such as data analysis, control theory, signal processing, relaxation and randomization, and robust optimization. In addition to strong and elegant …
-
Conic Reformulation Methods in Revenue Management
This thesis presents a comprehensive study on optimization problems in revenue management, with a particular focus on the development and application of conic programming reformulation techniques. The work is grounded in three distinct but interrelated papers, each addressing a unique aspect of …
-
Fast and Resilient Optimization-based Control with Spacecraft Applications
Trajectory optimization, which forms a key component of modern guidance, navigation, and control (GNC) systems, occupies the middle layer within a three-layer hierarchy, where the top layer is mission planning (or high-level decision making) and the bottom layer consists of low-level computation in …
-
The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics
… class of algorithms for solving various forms of conic optimization problems. Most IPMs use a modified Newton method to determine the search direction at each iteration. The system of equations corresponding to the modified Newton system can often be reduced to the so-called normal equation, a …
-
A Primal-Dual Framework for Approximation Algorithms using Semidefinite Programming
Duality lies in the foundation of mathematical optimization. Within combinatorial optimization, linear programming (LP) duality crucially allows for polynomial-sized proofs of optimality, guiding the design of several algorithms. This work exploits a set of alternative formulations of convex …
-
Stochastic Operation of Distribution Networks with Voltage Dependent Load
… magnitude over the nonlinear SOSM, based on a conic generalization of the Chebyshev bound. The resulting constraint handles the joint violation considering the correlation among individual constraints and also relaxes the nonconvex minimum voltage constraint. With the inclusion of BESS in the …
-
Regularized distributionally robust optimization with applications in finance
… large prediction errors. Distributionally robust optimization (DRO) is a successful candidate for dealing with distributional uncertainty. It considers the optimization of the worst-case scenario in an ambiguity set of probability distributions whose size is quantified by some discrepancy measures …
-
Optimization Methods for Tabular Data Protection
… to the given norm CTA can be formulated as an optimization problem: Liner Programing (LP) for l1, Quadratic Programing (QP) for l2. In this thesis we present an alternative reformulation of l1-CTA as Second-Order Cone (SOC) optimization problems. All three models can be solved using appropriate …
-
Error Bounds and Singularity Degree in Semidefinite Programming
An important process in optimization is to determine the quality of a proposed solution. This usually entails calculation of the distance of a proposed solution to the optimal set and is referred to as forward error. Since the optimal set is not known, we generally view forward error as …
-
Block-decomposition and accelerated gradient methods for large-scale convex optimization
… accelerated *9gradient methods for large-scale conic programming and convex optimization, respectively. The BD methods, discussed in the first two parts of this thesis, are inexact versions of proximal-point methods applied to two-block-structured inclusion problems. The adaptive accelerated …