نتایج جستجو برای: convex quadratic symmetric cone programming
تعداد نتایج: 529050 فیلتر نتایج به سال:
Applying an interior-point method to the central-path conditions is a widely used approach for solving quadratic programs. Reformulating these in log-domain natural variation on this that our knowledge previously unstudied. In paper, we analyze methods and prove their polynomial-time convergence. We also they are approximated by classical barrier precise sense provide simple computational exper...
This paper proposes fuzzy regression analysis with non-symmetric fuzzy coefficients. By assuming non-symmetric triangular fuzzy coefficients and applying the quadratic programming formulation, the center of the obtained fuzzy regression model attains more central tendency compared to the one with symmetric triangular fuzzy coefficients. For a data set composed of crisp inputs-fuzzy outputs, two...
The Quadratic Convex Reformulation (QCR) method is used to solve quadratic unconstrained binary optimization problems. In this method, the semidefinite relaxation is used to reformulate it to a convex binary quadratic program which is solved using mixed integer quadratic programming solvers. We extend this method to random quadratic unconstrained binary optimization problems. We develop a Penal...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+∆k)xk = bk, where A is symmetric positive semidefinite and ∆k is diagonal positive semidefinite. Such sequences arise in several optimization methods, e.g., in affine-scaling methods for bound-constrained convex quadratic programming and bound-constrained linear least squares, as well as in trust-...
The Euclidean gradient projection is an efficient tool for the expansion of an active set in the activeset-based algorithms for the solution of bound-constrained quadratic programming problems. In this paper we examine the decrease of the convex cost function along the projected-gradient path and extend the earlier estimate given by Joachim Schöberl. The result is an important ingredient in the...
In this paper, we present a new method for solving quadratic programming problems, not strictly convex. Constraints of the problem are linear equalities and inequalities, with bounded variables. The suggested method combines the active-set strategies and support methods. The algorithm of the method and numerical experiments are presented, while comparing our approach with the active set method ...
We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with “lifting” and semidefinite programming (SDP) in methods such as PhaseLift and compete with recently developed non-convex techniques for phase retrieval. We relax the quadratic equations for phaseless mea...
A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum(-line...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید