Relevant bibliographies by topics / Second-Order Cone Programming

Academic literature 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:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Second-Order Cone Programming"

1

Alizadeh, F., and D. Goldfarb. "Second-order cone programming." Mathematical Programming 95, no. 1 (January 1, 2003): 3–51. http://dx.doi.org/10.1007/s10107-002-0339-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kobayashi, Kazuhiro, Sunyoung Kim, and Masakazu Kojima. "SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS." Journal of the Operations Research Society of Japan 51, no. 3 (2008): 241–64. http://dx.doi.org/10.15807/jorsj.51.241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hang, Nguyen T. V., Boris S. Mordukhovich, and M. Ebrahim Sarabi. "Second-order variational analysis in second-order cone programming." Mathematical Programming 180, no. 1-2 (November 3, 2018): 75–116. http://dx.doi.org/10.1007/s10107-018-1345-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xia, Yu. "Two-dimensional Second-Order Cone Programming." International Journal of Operational Research 5, no. 4 (2009): 468. http://dx.doi.org/10.1504/ijor.2009.025704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lobo, Miguel Sousa, Lieven Vandenberghe, Stephen Boyd, and Hervé Lebret. "Applications of second-order cone programming." Linear Algebra and its Applications 284, no. 1-3 (November 1998): 193–228. http://dx.doi.org/10.1016/s0024-3795(98)10032-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Averbakh, I., and Y. B. Zhao. "Relaxed robust second-order-cone programming." Applied Mathematics and Computation 210, no. 2 (April 2009): 387–97. http://dx.doi.org/10.1016/j.amc.2009.01.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Jiani, and Liwei Zhang. "Statistical Inference of Second-Order Cone Programming." Asia-Pacific Journal of Operational Research 35, no. 06 (December 2018): 1850044. http://dx.doi.org/10.1142/s0217595918500446.

Full text
Abstract:
The randomness of the second-order cone programming problems is mainly reflected in the objective function and the constraints both having random vectors. In this paper, we discuss the statistical properties of estimates of the respective optimal value and optimal solutions when the random vectors are estimated by their sample both in the objective function and the constraints, which are based on perturbation analysis theory of second-order cone programming. As an example we consider the problem of minimizing a sum of norms with weights.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Liwei, Shengzhe Gao, and Saoyan Guo. "Statistical Inference of Second-Order Cone Programming." Asia-Pacific Journal of Operational Research 36, no. 02 (April 2019): 1940003. http://dx.doi.org/10.1142/s0217595919400037.

Full text
Abstract:
In this paper, we study the stability of stochastic second-order programming when the probability measure is perturbed. Under the Lipschitz continuity of the objective function and metric regularity of the feasible set-valued mapping, the outer semicontinuity of the optimal solution set and Lipschitz continuity of optimal values are demonstrated. Moreover, we prove that, if the constraint non-degeneracy condition and strong second-order sufficient condition hold at a local minimum point of the original problem, there exists a Lipschitz continuous solution path satisfying the Karush–Kuhn–Tucker conditions.
APA, Harvard, Vancouver, ISO, and other styles
9

Liang, Zhizheng. "Feature Scaling via Second-Order Cone Programming." Mathematical Problems in Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/7347986.

Full text
Abstract:
Feature scaling has attracted considerable attention during the past several decades because of its important role in feature selection. In this paper, a novel algorithm for learning scaling factors of features is proposed. It first assigns a nonnegative scaling factor to each feature of data and then adopts a generalized performance measure to learn the optimal scaling factors. It is of interest to note that the proposed model can be transformed into a convex optimization problem: second-order cone programming (SOCP). Thus the scaling factors of features in our method are globally optimal in some sense. Several experiments on simulated data, UCI data sets, and the gene data set are conducted to demonstrate that the proposed method is more effective than previous methods.
APA, Harvard, Vancouver, ISO, and other styles
10

Alzalg, Baha M. "Stochastic second-order cone programming: Applications models." Applied Mathematical Modelling 36, no. 10 (October 2012): 5122–34. http://dx.doi.org/10.1016/j.apm.2011.12.053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

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

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
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
FUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO
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 exemplo, se deseja maximizar o fator de colapso, com o solo sujeito a condições de equilíbrio e ao critério de ruptura. O critério de ruptura utilizado foi o de Drucker-Prager. Neste trabalho, fez-se uso da programação cônica quadrática, conhecida por possibilitar a resolução de problemas de grande escala com muita eficiência. Empregou-se, para tanto, o solver Mosek. Além de ser possível determinar o fator de colapso, também se desenvolveu um método para calcular o fator de segurança da encosta. Ele reduz sucessivamente os parâmetros de resistência do solo, através do método de Newton-Raphson. Em casos de geometrias mais complexas, a formulação do problema teve que ser modificada. Uma força horizontal fictícia foi adicionada na condição de equilíbrio e unicamente ela foi majorada com o fator de colapso. Foi apenas através desta formulação que se pode simular a estabilidade de solos submetidos ao efeito de poropressão. A análise de fluxo foi simulada a parte no programa de elementos finitos desenvolvido por Miqueletto (2007). A resistência do solo depende dos valores de poropressão, que caracterizam os solos como saturados ou não saturados.
Numerical limit analysis was studied in order to evaluate an effective numerical procedure to solve three-dimensional slope stability problems. This numerical approach utilizes finite element method and mathematical programming. Mathematical programming is needed because the plasticity theorems, basic theorems for limit analysis, can be cast as optimization problems. The lower bound theorem consists of finding the maximum collapse multiplier that will lead the soil to the imminence of collapse. The soil will still be restricted to equilibrium conditions and the yield criterion will have to be satisfied everywhere. Drucker- Prager was the yield criterion chosen. In this thesis, the optimization problem is reformulated as a second order cone programming (SOCP). SOCP is known to solve large-scale problems with great computational efficiency and we used the solver Mosek. The model calculates not only the collapse multiplier, but also the safety factor for the slope. A strength reduction scheme was proposed, based on the Newton-Raphson method. For complex geometries cases, a novel formulation was developed. A fictitious horizontal force was added at the equilibrium equation and uniquely this force was increased by the multiplier factor. It was only through this reformulation that it was possible to assess stability of slopes subjected to porepressure effects. The groundwater flow was simulated separately in a finite element program developed by Miqueletto (2007). The soil strength depends on porepressure values, which define soils as saturated or unsaturated.
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.
Includes bibliographical references (p. 109-111).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
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 of this load distribution that will cause the body to collapse. This collapse multiplier results from solving an infinite dimensional saddle point problem, where the internal work rate is maximized over an admissible set of stresses -defined by a yield condition- and minimized over the linear space of kinematically admissible velocities for which the external work rate equals the unity. When strong duality is applied to this saddle point problem, the well-known convex (and equivalent) static and kinematic principles of limit analysis arise. In this thesis, an efficient procedure to compute strict upper and lower bounds for the exact collapse multiplier is presented, with a formulation that explicitly considers the exact convex yield condition. The approach consists of two main steps. First, the continuous problem, under the form of the static principle, is discretized twice (one per bound) by means of different combinations of finite element spaces for the stresses and velocities. For each discretization, the interpolation spaces are chosen so that the attainment of an upper or a lower bound is guaranteed. The second step consists of solving the resulting discrete nonlinear optimization problems. Towards this end, they are reformulated into the canonical form of Second-order Cone Programs, which allows for the use of primal-dual interior point methods that optimally exploit the convexity and duality properties of the limit analysis
(cont.) model and guarantee global convergence to the optimal solutions. To exploit the fact that collapse mechanisms are typically highly localized, a novel method for adaptive meshing is introduced based on local bound gap measures and not on heuristic estimates. The method decomposes the total bound gap as the sum of positive elemental contributions from each element in the mesh, and refines only those elements which are responsible for the majority of the numerical error. Finally, stand-alone computational certificates that allow the bounds to be verified independently, without recourse to the original computer program, are also provided. This removes the uncertainty about the reliability of the results, which frequently undermines the utility of computational simulations. The efficiency of the methodology proposed is illustrated with several applications in plane stress and plane strain, demonstrating that it can be used in complex, realistic problems as a supplement to other models.
by Héctor Ciria Suárez.
S.M.
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, transportation and congestion costs, is minimized. Response time to customer orders is a critical performance measure for a supply chain network. The decisions like where the plants and distribution centers are located aect the response time of the system. Response time is more sensitive to these decisions in a make-to-order business environment. In a distribution network where distribution centers function as cross-docking terminals, capacity or the service rate decisions also aect the response time performance. This study is closely related to a recent work Vidyarthi et al. (2009) which models distribution centers asM/G/1 queuing systems. They use the average waiting time formula ofM/G/1 queuing model. Thus, the average waiting time at a distribution center is a nonlinear function of the demand rate allocated to and the service rate available at the distribution center. The authors Vidyarthi et al. (2009) propose a linear approximation approach and a Lagrangian based heuristic for the problem. Dierent than the solution approach proposed in Vidyarthi et al. (2009), we propose a closed form formulation for the problem. In particular, we show that the waiting time function derived from M/G/1 queuing model can be represented via second order conic inequalities. Then, the problem becomes a mixed integer second order cone programming problem which can be solved by using commercial branch-and-bound software such as IBM ILOG CPLEX. Our computational tests show that proposed reformulation can be solved in reasonable CPU times for practical size instances.
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 programming, nonconvex box-constrained quadratic programming (BoxQP), and general quadratic programming (QP). We first study a SOCP relaxation for 0-1 integer programs and a sequential relaxation technique based on this SOCP relaxation. We present desirable properties of this SOCP relaxation, for example, this relaxation cuts off all fractional extreme points of the regular LP relaxation. We further prove that the sequential relaxation technique generates the convex hull of 0-1 solutions asymptotically. We next explore nonconvex quadratic programming. We propose a SDP relaxation for BoxQP based on relaxing the first- and second-order KKT conditions, where the difficulty and contribution lie in relaxing the second-order KKT condition. We show that, although the relaxation we obtain this way is equivalent to an existing SDP relaxation at the root node, it is significantly stronger on the children nodes in a branch-and-bound setting. New advance in optimization theory allows one to express QP as optimizing a linear function over the convex cone of completely positive matrices subject to linear constraints, referred to as completely positive programming (CPP). CPP naturally admits strong semidefinite relaxations. We incorporate the first-order KKT conditions of QP into the constraints of QP, and then pose it in the form of CPP to obtain a strong relaxation. We employ the resulting SDP relaxation inside a finite branch-and-bound algorithm to solve the QP. Comparison of our algorithm with commercial global solvers shows potential as well as room for improvement. The remainder is devoted to new techniques for solving a class of large-scale linear programming problems. First order methods, although not as fast as second-order methods, are extremely memory efficient. We develop a first-order method based on Nesterov's smoothing technique and demonstrate the effectiveness of our method on two machine learning problems.
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 nowadays because of both the low cost of digital charge-coupled device (CCD) cameras and the high resolution of multiple images from the wide field of views. To our knowledge, no research has been conducted on the relative motion of multi-camera systems with non-overlapping views to obtain a geometrically optimal solution. ¶ In this thesis, we solve the camera motion problem for multi-camera systems by using linear methods and convex optimization techniques, and we make five substantial and original contributions to the field of computer vision. First, we focus on the problem of translational motion of omnidirectional cameras, which are multi-camera systems, and present a constrained minimization method to obtain robust estimation results. Given known rotation, we show that bilinear and trilinear relations can be used to build a system of linear equations, and singular value decomposition (SVD) is used to solve the equations. Second, we present a linear method that estimates the relative motion of generalized cameras, in particular, in the case of non-overlapping views. We also present four types of generalized cameras, which can be solvable using our proposed, modified SVD method. This is the first study finding linear relations for certain types of generalized cameras and performing experiments using our proposed linear method. Third, we present a linear 6-point method (5 points from the same camera and 1 point from another camera) that estimates the relative motion of multi-camera systems, where cameras have no overlapping views. In addition, we discuss the theoretical and geometric analyses of multi-camera systems as well as certain critical configurations where the scale of translation cannot be determined. Fourth, we develop a global solution under an L∞ norm error for the relative motion problem of multi-camera systems using second-order cone programming. Finally, we present a fast searching method to obtain a global solution under an L∞ norm error for the relative motion problem of multi-camera systems, with non-overlapping views, using a branch-and-bound algorithm and linear programming (LP). By testing the feasibility of LP at the earlier stage, we reduced the time of computation of solving LP.¶ We tested our proposed methods by performing experiments with synthetic and real data. The Ladybug2 camera, for example, was used in the experiment on estimation of the translation of omnidirectional cameras and in the estimation of the relative motion of non-overlapping multi-camera systems. These experiments showed that a global solution using L∞ to estimate the relative motion of multi-camera systems could be achieved.
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érationnel afin de donner aux décideurs et aux gestionnaires les outils nécessaires pour mener à bien leur mission. Nous proposons ici deux outils d'évaluation de la stabilité d'ouvrages de soutènement en maçonnerie basés sur l'utilisation conjointe du calcul à la rupture avec des méthodes d'homogénéisation. Dans un premier temps, nous mettons d'abord au point un outil analytique permettant de dimensionner des ouvrages neufs ou d'évaluer la stabilité d'ouvrages peu déformés. Cet outil permet également de dimensionner des solutions de renforcement par clouage lorsque cela est jugé nécessaire. Dans un deuxième temps, nous implémentons cet outil dans un code numérique afin de lui donner la souplesse nécessaire à l'étude d'ouvrages non-conventionnels, de grandes taille ou fortement pathologique. Enfin, nous mettons en oeuvre plusieurs campagnes expérimentales qui nous fournissent les données nécessaires à la validation de ces modèles de calcul
Wherever stone is readily available, we encounter stone masonry buildings. Depending on customs or dedicated use, the blocks are used raw, lightly faced or perfectly cut, with or without the use of mortar. Althougth concrete has replaced masonry in new construction for some decades, the better part of the French built heritage is made of masonry, an heritage we are responsible for. This works aims at contributing to create a reliable scientific frame for that purpose. This thesis uses the yield design theory alongside with homogenisation techniques to study the stability of stone masonry earth retaining walls. First, we provide an analytical tool suitable for designing new structures or assessing the stability of existing ones that are still in good shape. Should it be needed, this tools allows for the design of a strengthening solution based on soil-nailing. Then, we implement it in a finite element code to give it the versatility required to study unconventionnal structures or structures badly damaged. We then present several experimental campaigns aiming at validating the proposed tools
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
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
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 solve this problem, we propose a simple yet effective exact algorithm, based on Branch-and-Bound and Second Order Cone Programming. The proposed algorithm was tested in 824 instances suggested in the literature. Optimal solutions are obtained for open problems with up to a thousand vertices. We consider both instances in the two- and three-dimensional space.
Esta pesquisa trata do Problema do Caixeiro Viajante Suficientemente Próximo, uma variante do Problema do Caixeiro Viajante que possui diversas aplicações em logística. No Problema do Caixeiro Viajante Suficientemente Próximo, ao invés de visitar o próprio vértice (cliente), o caixeiro deve visitar uma região especifica contendo este vértice. Para resolver este problema, é proposto um algoritmo exato, simples e efetivo, baseado em branch-and-bound e Programação Cônica de Segunda Ordem. O algoritmo proposto foi testado em 824 instâncias sugeridas na literatura. Soluções ótimas foram obtidas para instâncias com até mil vértices. Foram consideradas instâncias nos espaços bi e tridimensional.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Second-Order Cone Programming"

1

Prusty, Narayan, and Mehul Mohan. Learn ECMAScript - Second Edition: Discover the latest ECMAScript features in order to write cleaner code and learn the fundamentals of JavaScript. Packt Publishing - ebooks Account, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Second-Order Cone Programming"

1

Antoniou, Andreas, and Wu-Sheng Lu. "Quadratic, Semidefinite, and Second-Order Cone Programming." In Texts in Computer Science, 425–81. New York, NY: Springer US, 2021. http://dx.doi.org/10.1007/978-1-0716-0843-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kılınç-Karzan, Fatma, and Sercan Yıldız. "Two-Term Disjunctions on the Second-Order Cone." In Integer Programming and Combinatorial Optimization, 345–56. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07557-0_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tsang, Ivor W., and James T. Kwok. "Efficient Hyperkernel Learning Using Second-Order Cone Programming." In Machine Learning: ECML 2004, 453–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30115-8_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Min. "Estimating the Fundamental Matrix Using Second-Order Cone Programming." In Artificial Intelligence and Computational Intelligence, 581–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23896-3_72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chi, Xiaoni, and Jin Peng. "A Combined Newton Method for Second-Order Cone Programming." In Advances in Soft Computing, 605–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01216-7_64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhadan, Vitaly. "Dual Newton’s Methods for Linear Second-Order Cone Programming." In Mathematical Optimization Theory and Operations Research, 19–32. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-49988-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Drewes, Sarah, and Stefan Ulbrich. "Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming." In Mixed Integer Nonlinear Programming, 41–59. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1927-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhadan, Vitaly. "Dual Multiplicative-Barrier Methods for Linear Second-Order Cone Programming." In Communications in Computer and Information Science, 295–310. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38603-0_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Koldovský, Zbyněk, Jiří Málek, and Petr Tichavský. "Improving Relative Transfer Function Estimates Using Second-Order Cone Programming." In Latent Variable Analysis and Signal Separation, 227–34. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22482-4_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhadan, Vitaly. "A Variant of the Simplex Method for Second-Order Cone Programming." In Mathematical Optimization Theory and Operations Research, 115–29. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22629-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Second-Order Cone Programming"

1

Chu, Eric, Neal Parikh, Alexander Domahidi, and Stephen Boyd. "Code generation for embedded second-order cone programming." In 2013 European Control Conference (ECC). IEEE, 2013. http://dx.doi.org/10.23919/ecc.2013.6669712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Malani, Shreya, Dinesh Dileep Gaurav, and Rahul Agrawal. "Link Prediction via Second Order Cone Programming." In the 10th ACM Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3292522.3326053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Debnath, R., and H. Takahashi. "SVM Training: Second-Order Cone Programming versus Quadratic Programming." In The 2006 IEEE International Joint Conference on Neural Network Proceedings. IEEE, 2006. http://dx.doi.org/10.1109/ijcnn.2006.246822.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Raithatha, Ankor, Stephen Duncan, Kathryn Jackson, and Julian Allwood. "Second order cone programming in modeling incremental deformation." In 2007 American Control Conference. IEEE, 2007. http://dx.doi.org/10.1109/acc.2007.4282324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mountcastle, Paul, Tom Henretty, Aale Naqvi, and Richard Lethin. "Embedded second-order cone programming with radar applications." In 2015 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 2015. http://dx.doi.org/10.1109/hpec.2015.7322454.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Han, Yang, Chaohuan Hou, and Xiaochuan Ma. "Optimum Beamforming Based on Second Order Cone Programming." In 2008 Congress on Image and Signal Processing. IEEE, 2008. http://dx.doi.org/10.1109/cisp.2008.624.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Qi, Zhiquan, Yingjie Tian, and Yong Shi. "Regularized multiple-criteria linear programming via second order cone programming formulations." In the Data Mining and Intelligent Knowledge Management Workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2462130.2462134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tang, Maoqin, Qianwei He, Xiaoli Luo, Lei Liu, Yongji Wang, and Zhongtao Cheng. "Reentry Trajectory Optimization Based on Second Order Cone Programming." In 2020 Chinese Control And Decision Conference (CCDC). IEEE, 2020. http://dx.doi.org/10.1109/ccdc49329.2020.9164575.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhong, Kai, Prateek Jain, and Ashish Kapoor. "Fast second-order cone programming for safe mission planning." In 2017 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2017. http://dx.doi.org/10.1109/icra.2017.7989014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Guthrie, James, and Enrique Mallada. "Adversarial Model Predictive Control via Second-Order Cone Programming." In 2019 IEEE 58th Conference on Decision and Control (CDC). IEEE, 2019. http://dx.doi.org/10.1109/cdc40024.2019.9029244.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Second-Order Cone Programming"

1

Amela, R., R. Badia, S. Böhm, R. Tosi, C. Soriano, and R. Rossi. D4.2 Profiling report of the partner’s tools, complete with performance suggestions. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.023.

Full text
Abstract:
This deliverable focuses on the proling activities developed in the project with the partner's applications. To perform this proling activities, a couple of benchmarks were dened in collaboration with WP5. The rst benchmark is an embarrassingly parallel benchmark that performs a read and then multiple writes of the same object, with the objective of stressing the memory and storage systems and evaluate the overhead when these reads and writes are performed in parallel. A second benchmark is dened based on the Continuation Multi Level Monte Carlo (C-MLMC) algorithm. While this algorithm is normally executed using multiple levels, for the proling and performance analysis objectives, the execution of a single level was enough since the forthcoming levels have similar performance characteristics. Additionally, while the simulation tasks can be executed as parallel (multi-threaded tasks), in the benchmark, single threaded tasks were executed to increase the number of simulations to be scheduled and stress the scheduling engines. A set of experiments based on these two benchmarks have been executed in the MareNostrum 4 supercomputer and using PyCOMPSs as underlying programming model and dynamic scheduler of the tasks involved in the executions. While the rst benchmark was executed several times in a single iteration, the second benchmark was executed in an iterative manner, with cycles of 1) Execution and trace generation; 2) Performance analysis; 3) Improvements. This had enabled to perform several improvements in the benchmark and in the scheduler of PyCOMPSs. The initial iterations focused on the C-MLMC structure itself, performing re-factors of the code to remove ne grain and sequential tasks and merging them in larger granularity tasks. The next iterations focused on improving the PyCOMPSs scheduler, removing existent bottlenecks and increasing its performance by making the scheduler a multithreaded engine. While the results can still be improved, we are satised with the results since the granularity of the simulations run in this evaluation step are much ner than the one that will be used for the real scenarios. The deliverable nishes with some recommendations that should be followed along the project in order to obtain good performance in the execution of the project codes.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Second-Order Cone Programming' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography