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 33 for “"Conic programming"”.
-
Applications of Conic Programming Reformulations
… These reformulation often come in the form of a conic program. For example, nonconvex quadratically-constrained quadratic programs (QCQPs) are often relaxed to semidefinite programs (SDPs) and then tightened with valid inequalities. This dissertation gives a few different problems of interest and …
-
Conic programming for routing and location problems
Esta tesis doctoral desarrolla nuevos problemas en el campo de los modelos de transporte, con una perspectiva orientada al uso de drones. En este trabajo se definen nuevos modelos de transporte, tomando ciertos elementos de los problemas de localización, los cuales se resuelven con herramientas de …
-
Projection algorithms for conic programming with applications in compressed sensing
Convex conic programming is a general optimization model which includes linear, second-order-cone and semi-definite programming. Many of these programs can be solved via interior-point methods, yet the high demands on memory and computation can make these Newton-based algorithms impractical for …
-
AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING
… algorithms for solving a class of large-scale conic programming (CQP) problems which are fundamental problems in the field of mathematical optimization. These problems also arise from many important real-world applications. The thesis can be divided mainly into four parts. The first part of this …
-
MIXED INTEGER CONIC PROGRAMMING FORMULATION OF DISTRIBUTION OPTIMAL POWER FLOW AND UNIT COMMITMENT PROBLEMS
… work proposes a Mixed Integer Second Order Cone Programming (MISOCP) model for Distribution Optimal Power Flow (DOPF) by incorporating conic model of voltage control through a Load Tap Changer (LTC) as discrete control. A novel algorithm, Sequential Bound Tightening Algorithm (SBTA), is also …
-
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 …
-
THE LOCAL BEHAVIOR OF THE SHRINK-WRAPPING ALGORITHM FOR LINEAR PROGRAMMING
… (IPM) theory applies naturally to the class of conic programming problems arising from hyperbolicity cones. In particular, linear programming (LP), second-order conic programming (SOCP) and positive semi-definite programming (SDP) are themselves instances of conic programming problems of this …
-
ENRICHED CATEGORIES, QUANTALES, AND APPLICATIONS
… framework for studying a generalized form of conic programming. We generalize the notion of a linear cone in conic programming, obtaining a definition applicable in an arbitrary category. This formulation accommodates both classical cones in vector spaces and novel cone-like structures in …
-
A Two-Phase Augmented Lagrangian Method For Convex Composite Quadratic Programming
… recent interests in important convex quadratic conic programming problems, as well as from convex quadratic programming problems with dual block angular structures arising from network flows problems, two stage stochastic programming problems, etc. In this thesis, we first introduce a symmetric …
-
AMBIGUOUS RISK MEASURES AND PIECEWISE LINEAR UTILITY MODELS IN PORTFOLIO MANAGEMENT
… concave utility function. We provide conic programming formulations for the robust portfolio optimization problem under mean, covariance and support information. We also provide connections with a new convex risk measure, similar to the optimized certainty equivalent (OCE) risk measure …
-
OPTIMIZATION UNDER UNCERTAINTY USING EXPONENTIAL CONES
… to leverage the efforts in mixed-integer linear programming and second-order conic programming and demonstrate their effectiveness.
-
Essays on optimal reinsurance design, solvency analysis of deferred annuities and pension buyouts
… the first and second approaches and Second Order Conic Programming is applied to solve them. The second essay analyses the effect of stochastic mortality and interest rates in the solvency analysis of a portfolio of simple deferred annuity contracts and compares the results for deterministic and …
-
Convex Analysis in Quantum Information
… problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. …
-
Optimisation methods for electric power system operations
… of this thesis explores mixed-integer linear programming (MILP) approaches for the OPF and OTS problems. Extensive computational experiments are conducted to investigate the advantages and disadvantages of a widely used MILP method for the OTS problem. Building upon these insights, a new …
-
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 …
-
Conic Reformulation Methods in Revenue Management
… 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 revenue management. The first paper investigates the trade-off between pickup time and idle time in …
-
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 …
-
Efficient Numerical Algorithms for Structured Nonsmooth Min–Max and Adjustable Robust Optimization problems with Applications
… robust optimization models reformulated via conic programming reformulation. Splitting methods are a class of iterative algorithms well-suited to tackling these by exploiting the problem structure to split into subproblems. A particular splitting method is the extrapolated proximal algorithm …
-
Optimization in multi-relay wireless networks
… can be formulated and solved via second-order conic programming (SOCP). In addition, this part also proposes simple and fast iterative algorithms to directly solve these optimization problems.
-
Optimal Reinsurance Designs: from an Insurer’s Perspective
… we demonstrate that the second-order conic programming can be used to obtain the optimal solutions for a wide range of reinsurance models formulated by the empirical approach.
Page 1 of 2