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 50 for “"convexification"”.

  1. Verification of successive convexification algorithm

    … and free final time. Through the use of lossless convexification and successive convexification, this problem can be formulated as a series of iteratively solved convex problems that requires only a guess of a final time of flight. The solution’s physical feasibility is verified through a …

    texas Repository record for Verification of successive convexification algorithm (opens in a new tab)

  2. Convexification in Unconstrained Continuous Optimization

    In this Master’s thesis, we study the role of convexification as it is used in un- constrained optimization of smooth functions. Many variants of convexification exist, but a detailed study of their practical performance has not been performed. We complete such a study in this thesis since the …

    jhu Repository record for Convexification in Unconstrained Continuous Optimization (opens in a new tab)

  3. Lossless convexification of optimal control problems

    … optimal control theory. It then proves lossless convexification for three problems: 1) a minimum time rendezvous using differential drag, 2) a maximum divert and landing, and 3) a general optimal control problem with linear state constraints and mixed convex and non-convex control constraints. …

    texas Repository record for Lossless convexification of optimal control problems (opens in a new tab)

  4. 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 …

    texas Repository record for Lossless convexification of quadrotor motion planning with experiments (opens in a new tab)

  5. Successive Convexification & High Performance Feedback Control for Agile Flight

    The topic of this dissertation is successive convexification and high performance feedback control for agile flight. This document is divided into three primary branches. The first branch (Chapter 2) is focused on successive convexification -- a sequential convex programming approach that lends …

    washington Repository record for Successive Convexification & High Performance Feedback Control for Agile Flight (opens in a new tab)

  6. 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 …

    gatech Repository record for Convexification and Global Optimization of Problems Involving the Euclidean Norm (opens in a new tab)

  7. Successive Convexification of Non-convex Optimal Control Problems: Theory and Applications

    … of this dissertation centers around Successive Convexification, a family of iterative algorithms designed to solve non-convex constrained optimal control problems. This document begins with an introduction to optimal control and finite-dimensional optimization in Chapter 2. It then presents the …

    washington Repository record for Successive Convexification of Non-convex Optimal Control Problems: Theory and Applications (opens in a new tab)

  8. Vision-Based Hazard Detection and Real-Time Safe Trajectory Optimization Using Successive Convexification for Lunar Landing

    … dynamic constraints is solved using successive convexification (SCvx) optimization scheme. Where the hazard regions identified from descent imagery are represented as ellipse-avoidance chance constraints enforced at the terminal state, ensuring the lander avoids hazards with high confidence …

    gatech Repository record for Vision-Based Hazard Detection and Real-Time Safe Trajectory Optimization Using Successive Convexification for Lunar Landing (opens in a new tab)

  9. Robust Estimation of Motion Parameters and Scene Geometry : Minimal Solvers and Convexification of Regularisers for Low-Rank Approximation

    In the dawning age of autonomous driving, accurate and robust tracking of vehicles is a quintessential part. This is inextricably linked with the problem of Simultaneous Localisation and Mapping (SLAM), in which one tries to determine the position of a vehicle relative to its surroundings without …

    lund Repository record for Robust Estimation of Motion Parameters and Scene Geometry : Minimal Solvers and Convexification of Regularisers for Low-Rank Approximation (opens in a new tab) Download PDF for Robust Estimation of Motion Parameters and Scene Geometry : Minimal Solvers and Convexification of Regularisers for Low-Rank Approximation (opens in a new tab)

  10. 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 …

    vt Repository record for Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems (opens in a new tab)

  11. Sparse and Low-rank Constrained Optimization: Formulations, Theory, and Algorithms

    … convex representable. Hence, we leverage partial convexification to obtain a tractable convex relaxation of low-rank constrained optimization. While partial convexification is often practical, its solution quality lacks theoretical guarantees. We fill this gap by developing a new theory in convex …

    gatech Repository record for Sparse and Low-rank Constrained Optimization: Formulations, Theory, and Algorithms (opens in a new tab)

  12. Autonomous optimal Power Flow via Convex Solution - Sequential Linear Programming

    … to solve OPF however linearization based and convexification-based methods draw a lot of attention. Linearization methods have been used for years and are at the basis of many power systems problems. Linearization works well and scales well, however it is often dependent on the initial …

    gatech Repository record for Autonomous optimal Power Flow via Convex Solution - Sequential Linear Programming (opens in a new tab)

  13. Strong convex relaxations for quadratically constrained quadratic programs

    … the next three chapters of the thesis, we study convexification of sets related to the quadratically constrained quadratic program (QCQP). This is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving …

    gatech Repository record for Strong convex relaxations for quadratically constrained quadratic programs (opens in a new tab)

  14. Estimating and testing of functional data with restrictions

    … functions with constrained restrictions such as convexification and/or monotonicity, together with the development of computationally efficient algorithms to solve the constrained least square problem. This study, too, has potential for applications in various fields. For example, in economics …

    tamu Repository record for Estimating and testing of functional data with restrictions (opens in a new tab)

  15. Topics in linear and nonlinear discrete optimization

    … handling large-scale instances of them. Several convexification and underestimation techniques were proposed in the last decade as a part of the solution process, and we join this trend. The thesis has three major parts. The first part considers MINLP problems containing convex (in the sense of …

    gatech Repository record for Topics in linear and nonlinear discrete optimization (opens in a new tab)

  16. Global optimization of mixed-integer nonlinear programs via decision diagrams

    … problem structures that challenge existing convexification techniques. This dissertation develops a graph-based global optimization framework based on decision diagrams (DDs) that advances the state of the art in solving complex MINLPs. The proposed approach departs from traditional …

    iastate Repository record for Global optimization of mixed-integer nonlinear programs via decision diagrams (opens in a new tab)

  17. Real-time Optimization in Aerospace Systems

    … from optimal control theory called lossless convexification, whereby problems with non-convex control constraints are cast into equivalent convex ones. Convex optimization is then applied to all stages of a mission: from top level vehicle design, to high-level autonomy onboard the vehicle, to …

    washington Repository record for Real-time Optimization in Aerospace Systems (opens in a new tab)

  18. Controller Synthesis through Riemannian Optimization

    … control, we develop an intrinsic successive convexification framework that optimizes trajectories directly on the manifold of states and inputs, leading to improved numerical behavior in applications such as attitude guidance. This work demonstrates how exploiting the intrinsic manifold …

    washington Repository record for Controller Synthesis through Riemannian Optimization (opens in a new tab)

  19. Exploration of Nonconvex Solution Spaces via Operator Splitting Sequential Convex Programming

    Sequential convexification methods provide an efficient and reliable means of computing fea-sible trajectories in nonconvex solution spaces. However, a well-known limitation of these algorithms is that they are inherently local in nature, and typically converge to a solution in the neighborhood of …

    washington Repository record for Exploration of Nonconvex Solution Spaces via Operator Splitting Sequential Convex Programming (opens in a new tab)

  20. Essays on Married Women Labor Supply

    … In particular, I study the effect of the typical convexification approximation of the non-convex budgets, and the well-known Heckman critique of the lack of bunching at the kink points of budget sets in the Hausman model. I introduce measurement error in nonlabor income to create an uncertain …

    tamu Repository record for Essays on Married Women Labor Supply (opens in a new tab)

Page 1 of 3