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 9 of 9 for “"Convexification"”.
-
Lossless convexification of quadrotor motion planning with experiments
This thesis describes a motion planning method that is designed to guide an autonomous quadrotor. The proposed method is based on a novel lossless convexication, which was first introduced in (12), that allows convex representations of many non-convex control constraints, such as that of the …
-
Convexification and Global Optimization of Problems Involving the Euclidean Norm
… permutational symmetry groups, as well as the convexification of reverse convex sets defined by the Euclidean norm, as two key challenges for global optimization methods, and introduce a benchmark library of instances of this type. Furthermore, we advance the state of the art by developing …
-
Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems
This dissertation develops efficient solution techniques for general and problem-specific applications within nonconvex optimization, exploiting the constructs of the Reformulation-Linearization Technique (RLT). We begin by developing a technique to enhance general problems in nonconvex …
-
Mixed Integer Nonlinear Programs: Theory, Algorithms and Applications
… the concept of convex extensions, study its convexification properties, and apply it to develop tight relaxations for hyperbolic programs and pooling/blending problems. (2) We develop a theoretical framework for range-reduction and provide a unified treatment of existing and new domain …
-
Global optimization algorithms for semi-infinite and generalized semi-infinite programs
… framework and uses discretization coupled with convexification for the lower bounding problem and the interval constrained reformulation for the upper bounding problem. Within the framework of SIP we have also proposed a number of feasible-point methods that all rely on the same basic principle; …
-
Development of Hardware and Efficient, Robust Control Algorithms for a Nanosatellite Reaction Control System
… to existing methods where possible. Successive convexification is studied as a method of generating optimal slew trajectories, and a novel approach is presented to improve robustness of this process and allow its use in a model predictive control scheme. The efficiency and robustness of this …
-
Autonomous optimal trajectory design employing convex optimization for powered descent on an asteroid
… of the original problem, referred to as lossless convexification. A key finding is that this holds for all levels of gravity model fidelity. The designed thrust magnitude profiles were the bang-bang predicted by Optimal Control Theory.</p> <p>The first high fidelity gravity model employed was the …
-
Discrete Two-Stage Stochastic Mixed-Integer Programs with Applications to Airline Fleet Assignment and Workforce Planning Problems
… problems and accompany this relaxation with a convexification process. To make this process computationally efficient, we propose to construct a certain partial convex hull representation of the two-stage solution space, using the relaxed second-stage constraints and the restrictions confining …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… using the Reformulation-Linearization/Convexification Technique (RLT), and demonstrate the benefits of the resulting lifted formulations for several classes of problems. Specifically, we investigate RLT-enhanced Lagrangian dual formulations for the class of minimax mixed-integer 0-1 …