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 34 for “"convex programming"”.

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

    bayreuth Repository record for A strictly feasible sequential convex programming method (opens in a new tab)

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

    uiuc Repository record for Error Correction for High-Dimensional Data via Convex Programming (opens in a new tab)

  3. 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.

    uiuc Repository record for A Convex Programming Approach to Problems in VLSI Design (opens in a new tab)

  4. Condition numbers and properties of central trajectories in convex programming

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1997.

    mit Repository record for Condition numbers and properties of central trajectories in convex programming (opens in a new tab)

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

    vt Repository record for Internal convex programming, orthogonal linear programming, and program generation procedures (opens in a new tab)

  6. More homology flows

    … face. We show this problem can be reduced to a convex programming problem in dimension 2g, and also show some interesting properties of the feasible polytope.

    uiuc Repository record for More homology flows (opens in a new tab)

  7. Mixed-integer convex optimization : outer approximation algorithms and modeling power

    In this thesis, we study mixed-integer convex optimization, or mixed-integer convex programming (MICP), the class of optimization problems where one seeks to minimize a convex objective function subject to convex constraints and integrality restrictions on a subset of the variables. We focus on two …

    mit Repository record for Mixed-integer convex optimization : outer approximation algorithms and modeling power (opens in a new tab)

  8. Computational analysis of real-time convex optimization for control systems

    … which utilize real-time optimization. A general convex programming framework is used, to which primal-dual path-following algorithms are applied. The set of all optimization problem instances which may arise in an on-line procedure is characterized as a compact parametric set of convex

    mit Repository record for Computational analysis of real-time convex optimization for control systems (opens in a new tab)

  9. Traversing Rugged Domains: Explorations in Non-convex Optimization Theory and Software

    … and computational frameworks for nonlinear, nonconvex optimization problems in statistics, machine learning, and optimal control. Disciplined Geodesically Convex Programming (DGCP) extends convexity verification to Riemannian manifolds, enabling optimization on curved spaces with global …

    mit Repository record for Traversing Rugged Domains: Explorations in Non-convex Optimization Theory and Software (opens in a new tab)

  10. Ein Verfahren der sequentiellen, konvexen Optimierung mit kombinierter Trust-Region- und Moving-Asymptotes-Stabilisierung zur Lösung nichtlinearer, restringierter Optimierungsprobleme

    … Der Algorithmus "Trust-Region Sequential Convex Programming - TRSCP" wird vorgestellt und die globale Konvergenzeigenschaft des neuen Verfahrens wird nachgewiesen. TRSCP ist sowohl ein SCP-Verfahren, als auch eine Trust-Region-Methode. Im Unterschied zu anderen Ansätzen auf diesem Gebiet, …

    bayreuth Repository record for Ein Verfahren der sequentiellen, konvexen Optimierung mit kombinierter Trust-Region- und Moving-Asymptotes-Stabilisierung zur Lösung nichtlinearer, restringierter Optimierungsprobleme (opens in a new tab)

  11. Applications and limits of convex optimization

    … becomes vastly more tractable when reduced to a convex program, yet few can be simplified this way. At the heart of this thesis are two hard problems with unexpected convex reformulations. The Paulsen problem, a longstanding open problem in operator theory, was recently resolved by Kwok et al …

    mit Repository record for Applications and limits of convex optimization (opens in a new tab)

  12. Guidance and control of swarms of spacecraft

    … control problem is discretized, decoupled, and convexified so that the individual femtosats can efficiently solve the optimization. Sequential convex programming is used to generate the control sequences and trajectories required to safely and efficiently transfer a spacecraft from one position …

    uiuc Repository record for Guidance and control of swarms of spacecraft (opens in a new tab)

  13. Statistical Scheduling of Economic Dispatch and Energy Reserves of Hybrid Power Systems with High Renewable Energy Penetration

    … power system scheduling is formulated as a convex programming problem to minimize power operating cost, taking considerations of renewable energy generation, power generation-consumption balance and power system security. This new approach for scheduling hybrid power economic dispatch and …

    denver Repository record for Statistical Scheduling of Economic Dispatch and Energy Reserves of Hybrid Power Systems with High Renewable Energy Penetration (opens in a new tab)

  14. Variable annuity guaranteed lifetime withdrawal benefit and decentralized insurance

    … the pool allocation ratio matrix is derived, and convex programming techniques are applied to determine the optimal pooling mechanism in a constrained variance reduction setting. A tiered hierarchical generalization is also constructed to improve computational efficiency.

    uiuc Repository record for Variable annuity guaranteed lifetime withdrawal benefit and decentralized insurance (opens in a new tab)

  15. Design of Distributed Controllers Over Heterogeneous Networks

    … on the Youla-Kucera (Y-K) parameterization. Convex conditions are given to account for the structured interconnection and random packet drops. Third, we develop two distributed architectures and propose necessary and sufficient conditions to provide pre-specified performance levels for …

    uiuc Repository record for Design of Distributed Controllers Over Heterogeneous Networks (opens in a new tab)

  16. Acoustic source localization

    … Three methods of reconstruction -- Disciplined Convex Programming, Orthogonal Matching Pursuit, and Compressive Sensing -- are explored, and their robustness to noise, and sparsity are examined in simulation. Results show that Two-Step Iterative Shrinkage Threshold (TwIST) is the most robust to …

    mit Repository record for Acoustic source localization (opens in a new tab)

  17. Non-monotonic Lyapunov functions for stability of nonlinear and switched systems : theory and computation

    … special attention is given to techniques from convex optimization that allow for computationally tractable ways of searching for Lyapunov functions. Our theoretical contributions are therefore amenable to convex programming formulations. In the discrete time case, we propose two new sucient …

    mit Repository record for Non-monotonic Lyapunov functions for stability of nonlinear and switched systems : theory and computation (opens in a new tab)

  18. Towards Autonomy: Leveraging Nonlinearity In Predictive And Convex Optimization For Space Vehicle Guidance And Control

    … model predictive control (MPC) and sequential convex programming (SCP) techniques offer promising capabilities, their performance may be restricted when underlying dynamics are over-simplified relative to the true mission environment. This thesis addresses that gap by incorporating nonlinear, …

    umn Repository record for Towards Autonomy: Leveraging Nonlinearity In Predictive And Convex Optimization For Space Vehicle Guidance And Control (opens in a new tab)

  19. Statistical Methods for Complex and/or High Dimensional Data

    … as a special case. To solve the resulting non-convex optimization problem, we provide an algorithm that incorporates the difference of convex programming, augmented Lagrange and coordinate descent methods. Furthermore, we show that the aforementioned nnFSG method recovers the oracle estimate …

    york Repository record for Statistical Methods for Complex and/or High Dimensional Data (opens in a new tab)

  20. Learning with structured decision constraints

    … and mutual exclusivity, can be embedded in convex cones under a class of linear structured prediction models. The approach is also applicable to general affine constraints in vector regression tasks. Part 2 concerns the estimation of a rank-based choice model under substitution constraints. …

    mit Repository record for Learning with structured decision constraints (opens in a new tab)

Page 1 of 2