In this paper, a new method for quadratic programming with max-product fuzzy relation inequality constraints is proposed. First, the properties of the optimal solution are analyzed in several special cases of fuzzy re...
详细信息
ISBN:
(纸本)9783319665146;9783319665139
In this paper, a new method for quadratic programming with max-product fuzzy relation inequality constraints is proposed. First, the properties of the optimal solution are analyzed in several special cases of fuzzy relation quadratic programming. Simultaneously, some rules are presented to simplify the original fuzzy relation quadratic programming problem. Then, an algorithm is presented, based on rules, the branch and bound method and numerical algorithm for solving traditional quadratic programming problems with interval constraints. The proposed algorithm does not need to find all feasible minimal solutions. Hence, the amount of calculation is reduced. Some numerical examples are given to illustrate the feasibility and effectiveness of the proposed algorithm.
Reactive kinematic control in velocity space is closely related to the Jacobian presented in the system. However, if the Jacobian is rank-deficient, certain task-space velocities become unachievable, leading to contro...
详细信息
quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem. An additional convex relaxation of t...
详细信息
ISBN:
(纸本)1595933832
quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem. An additional convex relaxation of the quadratic approximation is shown to have additive approximation guarantees that apply even when the graph weights have mixed sign or do not come from a metric. The approximations are extended in a manner that allows tight variational relaxations of the MAP problem, although they generally involve non-convex optimization. Experiments carried out on synthetic data show that the quadratic approximations can be more accurate and computationally efficient than the linear programming and propagation based alternatives.
In this paper we present a pivotal-based algorithm for the global minimization of composite concave quadratic functions subject to linear constraints. It is shown that certain subclasses of this family yield easy-to-s...
详细信息
In this paper we present a pivotal-based algorithm for the global minimization of composite concave quadratic functions subject to linear constraints. It is shown that certain subclasses of this family yield easy-to-solve line search subproblems. Since the proposed algorithm is equivalent in efficiency to a standard parametric complementary pivoting procedure, the implication is that conventional parametric quadratic programming algorithms can now be used as tools for the solution of much wider class of complex global optimization problems. (C) 1998 Elsevier Science B.V. All rights reserved.
Blind equalization and signal separation are two well-established signal processing problems. In this paper, we present a quadratic programming algorithm for fast blind equalization and signal separation. By introduci...
详细信息
Blind equalization and signal separation are two well-established signal processing problems. In this paper, we present a quadratic programming algorithm for fast blind equalization and signal separation. By introducing a special non-mean-square error (MSE) objective function, we reformulate fractionally spaced blind equalization into an equivalent quadratic programming problem. Based on a clear geometric interpretation and a formal proof, we show that a perfect equalization solution is obtained at every local optimum of the quadratic program. Because blind source separation is, by nature and mathematically, a closely related problem, we also generalize the algorithm for blind signal separation. We show that by enforcing source orthogonalization through successive processing, the quadratic programming approach can be applied effectively. Moreover, the quadratic program is easily extendible to incorporate additional practical conditions, such as jamming suppression constraints. We also provide evidence of good performance through computer simulations.
This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective function...
详细信息
This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.
We describe a method for solving large-scale general quadratic programming problems. Our method is based upon a compendium of ideas which have their origins in sparse matrix techniques and methods for solving smaller ...
详细信息
We describe a method for solving large-scale general quadratic programming problems. Our method is based upon a compendium of ideas which have their origins in sparse matrix techniques and methods for solving smaller quadratic programs. We include a discussion on resolving degeneracy, on single phase methods and on solving parametric problems. Some numerical results are included.
The robust estimation of the autoregressive parameters is formulated in terms of the quadratic programming problem. This article's main contribution is to present an estimator that down weights both types of outli...
详细信息
The robust estimation of the autoregressive parameters is formulated in terms of the quadratic programming problem. This article's main contribution is to present an estimator that down weights both types of outliers in time series and improves the forecasting results. New robust estimates are yielded, by combining optimally two weight functions suitable for Innovation and Additive outliers in time series. The technique which is developed here is based on an approach of mathematical programming applications to 1(p)-approximation. The behavior of the estimators are illustrated numerically, under the additive outlier generating model. Monte Carlo results show that the proposed estimators compared favorably with respect to M-estimators and bounded influence estimators. Based on these results we conclude that one can improve the robust properties of AR(p) estimators using quadratic programming. (C) 1997 Elsevier Science B.V.
quadratic programming is a versatile tool for calculating estimates in penalized regression. It can be used to produce estimates based on L1 roughness penalties, as in total variation denoising. In particular, it can ...
详细信息
This paper studies the optimization problem for joint precoding design in a multi-antenna downlink channel using relaying. We formulate the joint source and relay precoding design by aiming at sum capacity maximizatio...
详细信息
This paper studies the optimization problem for joint precoding design in a multi-antenna downlink channel using relaying. We formulate the joint source and relay precoding design by aiming at sum capacity maximization. Since this problem is in general nonconvex, we first convert this problem into standard convex quadratic programs, and then propose an iterative joint precoding optimization algorithm by utilizing efficient quadratic programming approaches. We observe that the iterative method always yields optimal precoding matrices which diagonalize the compound channel of the backward (source-to-relay) and the forward (relay-to-destination) links at high SNR regimes. Motivated by this observation, we further develop an efficient structured precoding design. Simulation results are presented to verify the effectiveness of our proposed precoding schemes.
暂无评论