Log in

Relevant bibliographies by topics / Second-Order Cone Programming / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Second-Order Cone Programming.

Dissertations / Theses on the topic 'Second-Order Cone Programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 23 dissertations / theses for your research on the topic 'Second-Order Cone Programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Okuno, Takayuki. "Studies on Algorithms for Solving Generalized Second-Order Cone Programming Problems." 京都大学 (Kyoto University), 2013. http://hdl.handle.net/2433/174846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Jein-Shan. "Merit functions and nonsmooth functions for the second-order cone complementarity problem /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/5782.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

CAMARGO, JULIA DE TOLEDO. "THREE DIMENSIONAL LIMIT ANALYSIS USING SECOND ORDER CONE PROGRAMMING APPLIED TO SLOPE STABILITY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=26876@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>FUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO<br>Visando avaliar uma ferramenta numérica efetiva para resolução de problemas de estabilidade tridimensionais, a análise limite numérica foi estudada neste trabalho. Sua abordagem numérica requer o uso tanto do método dos elementos finitos quanto de programação matemática. Isto porque os teoremas da plasticidade, base da análise limite, podem ser colocados como problemas de otimização. No teorema do limite inferior, por

APA, Harvard, Vancouver, ISO, and other styles

4

Ciria, Suárez Héctor 1979. "Computation of upper and lower bounds in limit analysis using second-order cone programming and mesh adaptivity." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/16655.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.<br>Includes bibliographical references (p. 109-111).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Limit analysis is relevant in many practical engineering areas such as the design of mechanical structures or the analysis of soil mechanics. Assuming a rigid, perfectly-plastic solid subject to a static load distribution, the problem of limit analysis consists of finding the minimum multiple o

APA, Harvard, Vancouver, ISO, and other styles

5

Mohammad, Salimian. "A Mixed Integer Second Order Cone Programming Reformulation For A Congested Location And Capacity Allocation Problem On A Supply Chain Network." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615407/index.pdf.

Full text

Abstract:

Supply chain network design involves location decisions for production facilities and distribution centers. We consider a make-to-order supply chain environment where distribution centers serve as crossdocking terminals. Long waiting times may occur at a cross-docking terminal, unless sucient handling capacity is installed. In this study, we deal with a facility location problem with congestion eects at distribution centers. Along with location decisions, we make capacity allocation (service rate) and demand allocation decisions so that the total cost, including facility opening, transportatio

APA, Harvard, Vancouver, ISO, and other styles

6

Bornhorst, Nils [Verfasser], Marius [Akademischer Betreuer] Pesavento, Martin [Akademischer Betreuer] Haardt, Anja [Akademischer Betreuer] Klein, and Sebastian [Akademischer Betreuer] Schöps. "Energy-Efficient Distributed Multicast Beamforming Using Iterative Second-Order Cone Programming / Nils Bornhorst. Betreuer: Marius Pesavento ; Martin Haardt ; Anja Klein ; Sebastian Schöps." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2015. http://d-nb.info/1110980922/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Jieqiu. "Convex relaxations in nonconvex and applied optimization." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/654.

Full text

Abstract:

Traditionally, linear programming (LP) has been used to construct convex relaxations in the context of branch and bound for determining global optimal solutions to nonconvex optimization problems. As second-order cone programming (SOCP) and semidefinite programming (SDP) become better understood by optimization researchers, they become alternative choices for obtaining convex relaxations and producing bounds on the optimal values. In this thesis, we study the use of these convex optimization tools in constructing strong relaxations for several nonconvex problems, including 0-1 integer programm

APA, Harvard, Vancouver, ISO, and other styles

8

Kim, Jae-Hak, and Jae-Hak Kim@anu edu au. "Camera Motion Estimation for Multi-Camera Systems." The Australian National University. Research School of Information Sciences and Engineering, 2008. http://thesis.anu.edu.au./public/adt-ANU20081211.011120.

Full text

Abstract:

The estimation of motion of multi-camera systems is one of the most important tasks in computer vision research. Recently, some issues have been raised about general camera models and multi-camera systems. Using many cameras as a single camera is studied [60], and the epipolar geometry constraints of general camera models is theoretically derived. Methods for calibration, including a self-calibration method for general camera models, are studied [78, 62]. Multi-camera systems are an example of practically implementable general camera models and they are widely used in many applications nowaday

APA, Harvard, Vancouver, ISO, and other styles

9

Terrade, Benjamin. "Evaluation structurale des murs de soutènement en maçonnerie." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1203/document.

Full text

Abstract:

Partout où la pierre est facilement disponible, on trouve des constructions en maçonnerie de pierre. Suivant les coutumes et les usages, les blocs de pierres sont assemblés bruts, simplement ébauchés ou parfaitement taillés, avec ou sans l'ajout d'un liant. Supplantée par le béton dans les constructions neuves depuis le milieu du XX} siècle, les ouvrages en maçonnerie demeurent majoritaires dans le patrimoine bâti français, un patrimoine qu'il convient d'entretenir rationnellement. L'objectif de ce travail de thèse est de poursuivre l'élaboration d'un cadre scientifique rigoureux et opérationn

APA, Harvard, Vancouver, ISO, and other styles

10

Coutinho, Walton Pereira. "Um algoritmo branch-and-bound para o problema do caixeiro viajante suficientemente próximo." Universidade Federal da Paraíba, 2014. http://tede.biblioteca.ufpb.br:8080/handle/tede/5268.

Full text

Abstract:

Made available in DSpace on 2015-05-08T14:53:38Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 7900350 bytes, checksum: fbca2db827307d8c3ed2a1c15067d0da (MD5) Previous issue date: 2014-02-13<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES<br>This research deals with the Close-Enough Traveling Salesman Problem, a variant of the Traveling Salesman Problem wich has several applicatios in logistics. In the Close-Enough Traveling Salesman Problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To sol

APA, Harvard, Vancouver, ISO, and other styles

11

Pham, Anh Tu. "Détermination numérique des propriétés de résistance de roches argileuses." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1237/document.

Full text

Abstract:

Les capacités de résistance de l'argilite Callovo-Oxfordian (COx), qui est une roche hôte potentielle pour le dépôt souterrain profond de déchets radioactifs de haute activité en France, sont étudiées. À une échelle microscopique, des micros pores peuvent être observés dans la matrice. Une première étape d'homogénéisation a été réalisée afin d'évaluer le critère de résistance de la matrice. L'analyse microstructurale de ce matériau à quelques centaines d'échelle, référencée échelle échelle mésoscopique, montre une matrice argileuse et une distribution aléatoire d'inclusions minérales (quartz e

APA, Harvard, Vancouver, ISO, and other styles

12

Cheng, Jianqiang. "Stochastic Combinatorial Optimization." Thesis, Paris 11, 2013. http://www.theses.fr/2013PA112261.

Full text

Abstract:

Dans cette thèse, nous étudions trois types de problèmes stochastiques : les problèmes avec contraintes probabilistes, les problèmes distributionnellement robustes et les problèmes avec recours. Les difficultés des problèmes stochastiques sont essentiellement liées aux problèmes de convexité du domaine des solutions, et du calcul de l’espérance mathématique ou des probabilités qui nécessitent le calcul complexe d’intégrales multiples. A cause de ces difficultés majeures, nous avons résolu les problèmes étudiées à l’aide d’approximations efficaces.Nous avons étudié deux types de problèmes stoch

APA, Harvard, Vancouver, ISO, and other styles

13

Talina, Bernardo Júdice Franqueira Cotrim. "Quadratic programming versus second order con programming in portfolio optimization." Master's thesis, 2016. http://hdl.handle.net/10362/16803.

Full text

Abstract:

Despite the extensive literature in finding new models to replace the Markowitz model or trying to increase the accuracy of its input estimations, there is less studies about the impact on the results of using different optimization algorithms. This paper aims to add some research to this field by comparing the performance of two optimization algorithms in drawing the Markowitz Efficient Frontier and in real world investment strategies. Second order cone programming is a faster algorithm, appears to be more efficient, but is impossible to assert which algorithm is better. Quadratic Programming

APA, Harvard, Vancouver, ISO, and other styles

14

Bornhorst, Nils. "Energy-Efficient Distributed Multicast Beamforming Using Iterative Second-Order Cone Programming." Phd thesis, 2015. https://tuprints.ulb.tu-darmstadt.de/4387/1/Dissertation_Bornhorst_Nils.pdf.

Full text

Abstract:

In multi-user (MU) downlink beamforming, a high spectral efficiency along with a low transmit power is achieved by separating multiple users in space rather than in time or frequency using spatially selective transmit beams. For streaming media applications, multi-group multicast (MGM) downlink beamforming is a promising approach to exploit the broadcasting property of the wireless medium to transmit the same information to a group of users. To limit inter-group interference, the individual streams intended for different multicast groups are spatially separated using MGM downlink beamforming.

APA, Harvard, Vancouver, ISO, and other styles

15

Chen, I.-ching, and 陳怡靜. "Support vector regression with noise by using second-order cone programming." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/11385402094271423959.

Full text

Abstract:

碩士<br>義守大學<br>電機工程學系碩士班<br>96<br>In this thesis, the regression model establishment is made by support vector machine. And we use an algorithm of second-order cone programming (SOCP) to solve the problem of support vector regression with noise data. We can transform the support vector regression with noisy data problem into the SOCP problem by the operation of mathematical. After the transformation, merit function is applied to solve the SOCP problems. The SOCP algorithm could be applied in many engineering problems such as the filter design, robust control and some optimization problems. Comp

APA, Harvard, Vancouver, ISO, and other styles

16

Toh, Kim Chuan, Zhi Cai, and Robert M. Freund. "Solving symmetric indefinite systems in an interior-point method for second order cone programming." 2002. http://hdl.handle.net/1721.1/4016.

Full text

Abstract:

Many optimization problems can be formulated as second order cone programming (SOCP) problems. Theoretical results show that applying interior-point method (IPM) to SOCP has global polynomial convergence. However, various stability issues arise in the implementation of IPM. The standard normal equation based implementation of IPM encounters stability problems in the computation of search direction. In this paper, an augmented system approach is proposed to overcome the stability problems. Numerical experiments show that the new approach can improve the stability.<br>Singapore-MIT Alliance (SMA

APA, Harvard, Vancouver, ISO, and other styles

17

Wu, Xiao-Ren, and 吳孝仁. "Neural Network Approach for Nonlinear Complementarity Problem and Quadratic Programming with Second-Order Cone Constraints." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/ea44k2.

Full text

Abstract:

博士<br>國立臺灣師範大學<br>數學系<br>105<br>This dissertation focuses on two types of optimization problems, nonlinear complementarity problem (NCP for short) and quadratic programming with second-order cone constraints (SOCQP for short). Based on NCP-function and SOC-complementarity function, we propose suitable neural networks for each of them, respectively. For the NCP-function, we propose new one which is the generalization of natural residual function for NCP. It is a discrete generalization of natural residual function phinr, denoted as phinrp. Besides being a NCP-function, we also show its twice di

APA, Harvard, Vancouver, ISO, and other styles

18

Han, Deren. "Global Optimization with Polynomials." 2003. http://hdl.handle.net/1721.1/3883.

Full text

Abstract:

The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0 - 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-valued polynomial p(x) : Rn â R, as well the constraint case: minimize p(x) on a semialgebraic set K, i.e., a set defined by polynomial equalities and inequalities. We also summarize some questions that we are currently considering.<br>Singapore-MIT Alliance (SMA)

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, Xue. "Particle finite element method in geomechanics." Thesis, 2014. http://hdl.handle.net/1959.13/1055070.

Full text

Abstract:

Research Doctorate - Doctor of Philosophy (PhD)<br>Despite the wide application of the finite element method (FEM) in geotechnical engineering, the numerical analysis usually stops at the point when soil flow occurs and results in overall `failure'. In many cases, the so-called failure only represents a specific time point of the deformation process and the soil flow itself is of interest as well. A typical example is a landslide in which a transition of the soil behaviour is experienced from solid-like to liquid-like, and then back to solid-like. For such problems, a correct understanding of

APA, Harvard, Vancouver, ISO, and other styles

20

(5930891), Benjamin M. Tackett. "REAL-TIME TRAJECTORY OPTIMIZATION BY SEQUENTIAL CONVEX PROGRAMMING FOR ONBOARD OPTIMAL CONTROL." Thesis, 2021.

Find full text

Abstract:

<div>Optimization of atmospheric flight control has long been performed on the ground, prior to mission flight due to large computational requirements used to solve non-linear programming problems. Onboard trajectory optimization enables the creation of new reference trajectories and updates to guidance coefficients in real time. This thesis summarizes the methods involved in solving optimal control problems in real time using convexification and Sequential Convex Programming (SCP). The following investigation provided insight in assessing the use of state of the art SCP optimization architect

APA, Harvard, Vancouver, ISO, and other styles

21

Kim, Jae-Hak. "Camera Motion Estimation for Multi-Camera Systems." Phd thesis, 2008. http://hdl.handle.net/1885/49364.

Full text

Abstract:

The estimation of motion of multi-camera systems is one of the most important tasks in computer vision research. Recently, some issues have been raised about general camera models and multi-camera systems. Using many cameras as a single camera is studied [60], and the epipolar geometry constraints of general camera models is theoretically derived. Methods for calibration, including a self-calibration method for general camera models, are studied [78, 62]. Multi-camera systems are an example of practically implementable general camera models and they are widely used in many applications nowaday

APA, Harvard, Vancouver, ISO, and other styles

22

Ismailova, Darya. "Localization algorithms for passive sensor networks." Thesis, 2016. http://hdl.handle.net/1828/7747.

Full text

Abstract:

Locating a radiating source based on range or range measurements obtained from a network of passive sensors has been a subject of research over the past two decades due to the problem’s importance in applications in wireless communications, surveillance, navigation, geosciences, and several other fields. In this thesis, we develop new solution methods for the problem of localizing a single radiating source based on range and range-difference measurements. Iterative re-weighting algorithms are developed for both range-based and range-difference-based least squares localization. Then we propose

APA, Harvard, Vancouver, ISO, and other styles

23

Jagarlapudi, Saketha Nath. "Learning Algorithms Using Chance-Constrained Programs." Thesis, 2008. http://hdl.handle.net/2005/733.

Full text

Abstract:

This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown that chance-constraint approaches lead to improved algorithms for three important learning problems — classification with specified error rates, large dataset classification and Ordinal Regression (OR). Using moments of training data, the CCPs are posed as Second Order Cone Programs (SOCPs). Novel iterative algorithms for solving the resulting SOCPs are also derived. Borrowing ideas from robust optimization theory, the proposed formulations are made robust to moment estimation errors. A maximum

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!