نتایج جستجو برای: quadratic optimization
تعداد نتایج: 358632 فیلتر نتایج به سال:
In this paper we present a mathematical model for archetypal analysis of data represented by means of intervals of real numbers. We extend the model for single-valued data proposed in the pioneering work of Cutler and Breiman on this topic. The core problem is a non-convex optimization one, which we solve by means of a sequential quadratic programming method. We show numerical experiments perfo...
This paper is concerned with a Superlinearly feasible SQP algorithm algorithm for general constrained optimization. As compared with the existing SQP methods, it is necessary to solve equality constrained quadratic programming sub-problems at each iteration, which shows that the computational effort of the proposed algorithm is reduced further. Furthermore, under some mild assumptions, the algo...
Quadratically constrained quadratic programs (QQPs) problems play an important modeling role in many diverse problems. These problems are in general NP hard and numerically intractable. Semidefinite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation pr...
We review the motivation for, the current state-of-the-art in convergence results, and some open questions concerning the stabilized version of the sequential quadratic programming algorithm for constrained optimization. We also discuss the tools required for its local convergence analysis, globalization challenges, and extentions of the method to the more general variational problems.
Introduction Since its popularization in the late s Sequential Quadratic Program ming SQP has arguably become the most successful method for solving nonlinearly constrained optimization problems As with most optimization methods SQP is not a single algorithm but rather a conceptual method from which numerous speci c algorithms have evolved Backed by a solid theoretical and computational foundat...
In this paper novel CNN based multiuser detection algorithms are proposed which can provide high performance mobile communication. Multiuser detection in CDMA system come down to quadratic optimization. CNNs are capable of fast quadratic optimization when the quadratic form arising from the detection problem is generated by a sparse matrix. Since multiuser communication under heavy loaded scena...
The presence of complementarity constraints brings a combinatorial flavour to an optimization problem. A quadratic programming problem with complementarity constraints can be relaxed to give a semidefinite programming problem. The solution to this relaxation can be used to generate feasible solutions to the complementarity constraints. A quadratic programming problem is solved for each of these...
This paper presents a new formulation of multi-instance learning as maximum margin problem, which is an extension of the standard C-support vector classification. For linear classification, this extension leads to, instead of a mixed integer quadratic programming, a continuous optimization problem, where the objective function is convex quadratic and the constraints are either linear or bilinea...
We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the resu...
We consider the NP-hard problem of finding a minimum norm vector in n-dimensional real or complex Euclidean space, subject to m concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an O(m) approximation in the real case, and an O(m) approximation in the complex case. Moreo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید