k-EVCLUS: Clustering Large Dissimilarity Data in the Belief Function Framework
2
Citation
10
Reference
10
Related Paper
Citation Trend
Keywords:
Sample complexity
Quadratic function is one of the important topic in mathematics. The purpose of this study is to describe the mistakes made by students when drawing a quadratic function graph. In this research, the focus of the problem is what type of mistakes made by students in drawing a graph of quadratic functions. The form of error here referred to an error in doing the exercise of drawing quadratic function graph in learning with the PBL model using a true or false strategy assisted by GeoGebra application. The conclusion of this research states that the error in drawing quadratic function graph is dominated by procedural errors. PBL model with true or false strategy with the help of GeoGebra application can be an alternative learning to overcome students' mistakes in drawing quadratic function graphs
Cite
Citations (0)
In this paper, sufficient global optimality conditions are presented for nonconvex quadratic programming problems with quadratic constraints as well as hyperrectangle constraints. The new conditions are obtained by making use of quadratic underestimators of quadratic function. We first introduce how to construct quadratic underestimators of quadratic function.Then, by using convex quadratic underestimators of the Lagrangian function at the KarushKuhn-Tucker point, we establish sufficient global optimality conditions for nonconvex quadratic programming problems. And we propose sufficient global optimality conditions by utilizing the minimum eigenvalue and quadratic underestimators. Finally, by using quadratic underestimators, we establish the sufficient condition for nonconvex quadratic programming problems with quadratic constraints.
Second-order cone programming
Sequential quadratic programming
Isotropic quadratic form
Definite quadratic form
Cite
Citations (0)
In this paper we study the global optimality conditions for some nonconvex quadratic program problems with quadratic constraints by using a new approach to establish sufficient global conditions suggested by Z.Y.Wu recently,and obtain some sufficient global optimality conditions for some nonconvex quadratic programs with quadratic constraints and derive some sufficient global optimality conditions of some nonconvex unconstrained quadratic programs at the same time.We also prove that,in some special cases,some results obtained in this paper are equivalent to the results in some references and even extend some corresponding results in some references in present information.
Quadratic model
Global Optimization
Cite
Citations (0)
Sequential quadratic programming
Cite
Citations (0)
In this paper,a class of quadratic program problem with quadratic constrains is studied.Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L-subdifferential,which ensures that a feasible point is a global minimzer of a nonconvex quadratic minimization problem subject to quadratic constraints.
Minification
Quadratic model
Cite
Citations (0)
Isotropic quadratic form
Cite
Citations (0)
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, quadratic and cubic bounds. For quadratic bounds, we use affine functions as Lagrange multipliers. We demonstrate that most semi-definite relaxations can be obtained as the dual of a quadratic bound. In addition, we study bounds obtained by changing the ground set. For cubic bounds, in addition to affine multipliers we employ quadratic functions. We provide a comparison between the proposed cubic bound and typical bounds for standard quadratic programs. Moreover, we report comparison results of a quadratic and a cubic bound for some non-convex quadratically constrained quadratic programs.
Quadratic growth
Isotropic quadratic form
Second-order cone programming
Cite
Citations (0)
In this paper, a class of quadratic program problem with quadratic constrains is studied. Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L- subdifferential. We also prove that, in the special cases, some sufficient global optimality conditions can be obtained at the same time.
Quadratic model
Cite
Citations (0)
This chapter discusses quadratic equations and quadratic functions, which are the simplest type of non-linear relationship. It illustrates that a quadratic function, when graphed, produces a characteristically U-shaped curve. The chapter then shows how to solve quadratic equations, including simultaneous quadratic equations. At the end of the chapter two applications of quadratic functions in economics are briefly presented.
Isotropic quadratic form
Cite
Citations (0)
In this paper, we give a positive answer to the open question: Can there exist 4 limit cycles in quadratic near-integrable polynomial systems? It is shown that when a quadratic integrable system has two centers and is perturbed by quadratic polynomials, it can generate at least 4 limit cycles with (3,1) distribution. The method of Melnikov function is used.
Cite
Citations (2)