نتایج جستجو برای: circular cone optimization
تعداد نتایج: 423658 فیلتر نتایج به سال:
We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators...
INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Linear Project Second Order-Cone Programme Zhenhua Li, Wenling Zhao *1,2 School of Science,Shandong University of Technology, Zibo,255091,China [email protected] Abstract In recent years cone constraint optimization problems has been favored by scholars, especially for the second-order cone constraints programming problem,the...
We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...
We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...
These notes give an introduction to duality theory in the context of linear and positive semidefinite programming. These notes are based on material from Convex Analysis and Nonlinear Optimization by Borwein and Lewis and Numerical Optimization by Nocedal and Wright. Two examples are given to show how duality can be used. The first optimization application is to find the matrix in an affine fam...
Robust optimization is an important technique to immunize optimization problems against data uncertainty. In the case of a linear program and an ellipsoidal uncertainty set, the robust counterpart turns into a second-order cone program. In this work, we investigate the efficiency of linearizing the second-order cone constraints of the latter. This is done using the optimal linear outer-approxim...
We give an overview of cone optimization software, with special attention to the differences between the existing packages. We assume the reader is familiar with the theory and algorithms of cone optimization, thus technical details are kept at a minimum. We also outline current research trends and area of potential improvement. 1 Problem description Conic optimization solvers target problems o...
We consider a general multiobjective optimization problem with five basic optimality principles: efficiency, weak and proper Pareto optimality, strong efficiency and lexicographic optimality. We generalize the concept of tradeoff directions defining them as some optimal surface of appropriate cones. In convex optimization, the contingent cone can be used for all optimality principles except lex...
We develop algorithms to construct inner approximations of the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and Majumdar, we describe an iterative process through which our approximation is improved at every step. This is done using ideas from column generatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید