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 143 for “"convex programming"”.
-
Duality in convex programming
Problems of minimizing a convex function or maximizing a concave function over a convex set are called convex programming problems. Duality principles relate two problems, one a minimization problem, the other a maximization problem, in such a way that a solution to one implies a solution to the …
-
A strictly feasible sequential convex programming method
… optimization methods, for example sequential convex programming methods. Sequential convex programming (SCP) formulates separable and strictly convex nonlinear subproblems iteratively by approximating the objective and the constraints. Lower and upper asymptotes are introduced to truncate the …
-
Blind Demodulation via Convex and Non-Convex Programming
… of $x$ and $w$ are known which admits intuitive convex programs. For the generative prior case, we study a non-convex program, the empirical risk minimization program. For the case where the vectors have known signs and belong to known subspaces, we introduce the convex program BranchHull, which …
-
Scalable and data-driven approaches to convex programming
… program can be solved exactly by means of a convex relaxation. We also link such a relaxation to the multi-agent optimisation framework explored previously, showing how distributed schemes can be leveraged to obtain the optimal solution.</p> <p>Other challenging optimisation problems arise …
-
Trajectory Optimization and Guidance Design by Convex Programming
… and Control (CG&C). By taking advantage of convex optimization and highly efficient interior point methods, CG&C allows complicated guidance and control problems to be solved in real time and offers great potential for onboard applications. With the significant increase in computational …
-
Linear phase filter bank design by convex programming
… because their natural formulations are nonconvex constrained optimization problems. Therefore, there is a strong motivation to cast the design problems into convex optimization problems whose globally optimal solutions can be efficiently obtained. The main contributions of this dissertation …
-
Constrained Spacecraft Attitude Control Using Sequential Convex Programming
This thesis describes how sequential convex programming can be used to guide and controlthe attitude of a spacecraft which is subject to pointing constraints. The constraints are expressed as convex contraints, and the dynamics are linearized and discretized using direct collocation and a piecewise …
-
Computing optimal designs for regression models via convex programming
… information matrix, respectively. Semide nite programming (SDP) is concerned with optimizing a linear objective function subject to a linear matrix being positive semide nite. Two powerful MATLAB add-ons, SeDuMi and CVX, have been developed to solve SDP problems e ciently. In this paper, we …
-
A convex programming approach for design of standard cells
… the design of VLSI circuits. We have proposed a convex programming technique for the design of a standard cell library. The objective is to minimize the area of a cell subject to constraints over worst-case propagation delay of the cell and the worst-case power required to drive the cell. It has …
-
Error Correction for High-Dimensional Data via Convex Programming
Finally, we show how these theoretical developments lead to simple, scalable, and robust algorithms for face recognition in the presence of varying illumination and occlusion. The idea is extremely simple: seek the sparsest representation of the test image as a linear combination of training images …
-
A Convex Programming Approach to Problems in VLSI Design
Two problems in VLSI CAD, namely, those of transistor sizing and design centering, are dealt with in this thesis.
-
A mixed integer convex programming approach to constrained attitude guidance
… The CAG formulation makes use of Mixed Integer Convex Programming (MICP) in order to impose, approximately, the unity constraint on the quaternion magnitude, where the approximation accuracy can be set to a desired accuracy. The solution complexity of the MICP formulation increases exponentially …
-
Internal convex programming, orthogonal linear programming, and program generation procedures
Three topics are developed: interval convex programming, and program generation techniques. The interval convex programming problem is similar to the convex programming problem of the real number system except that all parameters are specified as intervals of real numbers rather than as real …
-
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 …
-
A modified penalty term for the sequential unconstrained minimization technique for convex programming problems
… Unconstrained Minimization Technique (SUMT) for Convex Programming Problems is modified by the introduction of an exponent in the penalty term. The exponent is introduced to increase the rate of convergence of the method for nonlinear problems with solutions on the boundary of one or more …
-
Robust Sequential Convex Programming for Quadrotor Trajectory Planning with Obstacle Avoidance Under Wind Disturbances
… trajectory in a no-wind setting using Sequential Convex Programming (SCP) applied to a 6-state, 3-DoF quadrotor model. This trajectory satisfies all state, control, and obstacle constraints while minimizing fuel use. However, in the presence of constant wind, the nominal path becomes unreliable …
Page 1 of 8