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 53 for “"Second order cone programming"”.

  1. Variational Analysis In Second-Order Cone Programming And Applications

    This dissertation conducts a second-order variational analysis for an important class on nonpolyhedral conic programs generated by the so-called second-order/Lorentz/ice-cream cone. These second-order cone programs (SOCPs) are mathematically challenging due to the nonpolyhedrality of the underlying …

    wayne-thes Repository record for Variational Analysis In Second-Order Cone Programming And Applications (opens in a new tab)

  2. Robust optimization in support-vector machines and applications.

    … resulting optimization model is equivalent to a second order cone-programming problem. Specifically those techniques are used both for pattern classification and regression analysis.

    oklahoma-thes Repository record for Robust optimization in support-vector machines and applications. (opens in a new tab)

  3. Convex relaxations of the maximin dispersion problem

    … problems. This thesis studies semidefinite and second-order cone programming convex relaxations of the maximin dispersion problem. Providing nontrivial approximation bounds, we believe that our SDP and SOCP relaxation methods are useful in large-scale optimization. The thesis is organized as …

    ubc Repository record for Convex relaxations of the maximin dispersion problem (opens in a new tab) Download PDF for Convex relaxations of the maximin dispersion problem (opens in a new tab)

  4. NOVEL NUMERICAL PROCEDURES FOR LIMIT ANALYSIS OF STRUCTURES: MESH-FREE METHODS AND MATHEMATICAL PROGRAMMING

    … strategy adopted as well as on the mathematical programming tools applied, which are the key ingredients of a typical computational limit analysis procedure. In this research, the Element-Free Galerkin (EFG) discretisation strategy is used to approximate the displacement and moment fields in …

    whiterose Download PDF for NOVEL NUMERICAL PROCEDURES FOR LIMIT ANALYSIS OF STRUCTURES: MESH-FREE METHODS AND MATHEMATICAL PROGRAMMING (opens in a new tab)

  5. Underlying paths and local convergence behaviour of path-following interior point algorithm for SDLCP and SOCP

    … linear complementarity problem (SDLCP) and second order cone programming (SOCP). Using this definition, we show the existence of off-central path for SDLCP for general direction. Restricting to a particular direction, we analyse a simple SDP example to show that not all off-central paths are …

    nus Repository record for Underlying paths and local convergence behaviour of path-following interior point algorithm for SDLCP and SOCP (opens in a new tab) Download file for Underlying paths and local convergence behaviour of path-following interior point algorithm for SDLCP and SOCP (opens in a new tab)

  6. ADDRESSING DEMAND UNCERTAINTY IN INVENTORY MANAGEMENT: NEW METHODS AND SOLUTIONS

    … robust newsvendor problem, using fourth-order moment information. We simplify this complex problem into more manageable forms, either as a Second Order Cone Programming (SOCP) problem or by minimizing a convex function, leading to novel, efficient solutions. Next, we tackle the …

    nus Repository record for ADDRESSING DEMAND UNCERTAINTY IN INVENTORY MANAGEMENT: NEW METHODS AND SOLUTIONS (opens in a new tab) Download file for ADDRESSING DEMAND UNCERTAINTY IN INVENTORY MANAGEMENT: NEW METHODS AND SOLUTIONS (opens in a new tab)

  7. Robust Beamforming for Cognitive and Cooperative Wireless Networks

    … In the former case an algorithm containing second order cone programming problems, and in the latter case, an algorithm containing semidefinite programming problems are proposed to perform the beamforming process. Finally, numerical simulations are provided as well to assess the performance …

    nus Repository record for Robust Beamforming for Cognitive and Cooperative Wireless Networks (opens in a new tab) Download file for Robust Beamforming for Cognitive and Cooperative Wireless Networks (opens in a new tab)

  8. AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING

    … 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 thesis …

    nus Repository record for AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING (opens in a new tab) Download file for AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING (opens in a new tab)

  9. Service System Design with Immobile Servers, Stochastic Demand and Economies of Scale

    … their capacity, and assign customers to them in order to improve the service quality and the customers' experience while minimizing the capacity acquisition cost, the customer access cost, and the average waiting cost. While the centralization of facilities will lead to economies of scale, …

    waterloo Repository record for Service System Design with Immobile Servers, Stochastic Demand and Economies of Scale (opens in a new tab)

  10. MIXED INTEGER CONIC PROGRAMMING FORMULATION OF DISTRIBUTION OPTIMAL POWER FLOW AND UNIT COMMITMENT PROBLEMS

    This 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 …

    mtu Repository record for MIXED INTEGER CONIC PROGRAMMING FORMULATION OF DISTRIBUTION OPTIMAL POWER FLOW AND UNIT COMMITMENT PROBLEMS (opens in a new tab)

  11. Distributionally robust binary classifier under Wasserstein distance

    … general problem boils down to an easy-to-solve second- order cone programming problem. The robustified SVM is then applied to synthetic data with and without contamination, and our simulation studies show that our robustified SVM model can outperform the classical SVM and the extreme empirical …

    calgary Repository record for Distributionally robust binary classifier under Wasserstein distance (opens in a new tab)

  12. Variational Analysis Of Composite Optimization

    … is devoted to the study of the first- and second-order variational analysis of the composite functions with applications to composite optimization. By considering a fairly general composite optimization problem, our analysis covers numerous classes of optimization problems such as …

    wayne-thes Repository record for Variational Analysis Of Composite Optimization (opens in a new tab)

  13. Comparison of different methods for OPF problem of multi-objective optimization

    … OPF problem using mixed integer SOCP (Second Order Cone Programming). In order to show the applicability of the 2 models, result comparisons on the 3 aspects mentioned are generated and discussed. Results show that the VSC-based BESS equivalent circuit model has better performance than …

    glasgow Repository record for Comparison of different methods for OPF problem of multi-objective optimization (opens in a new tab)

  14. Computing Realistic Terrains from Imprecise Elevations

    … problems (3) and (4) can be approximated using Second Order Cone Programming. We also consider versions of these problems for terrains one dimension down, where the output is a polyline. Here we give very efficient algorithms for all objective functions considered. Finally, we go beyond terrains …

    waterloo Repository record for Computing Realistic Terrains from Imprecise Elevations (opens in a new tab)

  15. Trajectory Optimization and Guidance Design by Convex Programming

    … problems are investigated by a successive second-order cone programming method. Then, this convex method is extended and improved to solve hypersonic entry trajectory optimization problems by taking advantage of line-search and trust-region techniques. Finally, the successive convex …

    purdue-thes Repository record for Trajectory Optimization and Guidance Design by Convex Programming (opens in a new tab)

  16. Autonomous Trajectory Planning by Convex Optimization

    <p>The objective of this dissertation is to use second-order cone programming (SOCP) for autonomous trajectory planning of optimal control problems arisen from aerospace applications. Rendezvous and proximity operations (RPO) of spacecraft in any general orbit include various constraints on …

    iastate Repository record for Autonomous Trajectory Planning by Convex Optimization (opens in a new tab)

  17. 3D ultimate limit state analysis using discontinuity layout optimization

    … and Mohr-Coulomb yield criteria, using efficient second order cone programming. The new formulation can be stated in kinematic, energy balance form or static, equilibrium form. The derivation from first principles of both kinematic and equilibrium forms is described, allowing full …

    whiterose Download PDF for 3D ultimate limit state analysis using discontinuity layout optimization (opens in a new tab)

  18. Variable screening and graphical modeling for ultra-high dimensional longitudinal data

    … used pairwise coordinate descent combined with second order cone programming to optimize the penalized likelihood and estimate the parameters. Furthermore, we extended the nodewise regression method the for longitudinal data case. Simulation and real data analysis exhibit the competitive …

    vt Repository record for Variable screening and graphical modeling for ultra-high dimensional longitudinal data (opens in a new tab)

Page 1 of 3