共查询到20条相似文献,搜索用时 15 毫秒
1.
We study convex relaxations of nonconvex quadratic programs. We identify a family of so-called feasibility preserving convex relaxations, which includes the well-known copositive and doubly nonnegative relaxations, with the property that the convex relaxation is feasible if and only if the nonconvex quadratic program is feasible. We observe that each convex relaxation in this family implicitly induces a convex underestimator of the objective function on the feasible region of the quadratic program. This alternative perspective on convex relaxations enables us to establish several useful properties of the corresponding convex underestimators. In particular, if the recession cone of the feasible region of the quadratic program does not contain any directions of negative curvature, we show that the convex underestimator arising from the copositive relaxation is precisely the convex envelope of the objective function of the quadratic program, strengthening Burer’s well-known result on the exactness of the copositive relaxation in the case of nonconvex quadratic programs. We also present an algorithmic recipe for constructing instances of quadratic programs with a finite optimal value but an unbounded relaxation for a rather large family of convex relaxations including the doubly nonnegative relaxation. 相似文献
2.
Motivated by the fact that important real-life problems, such as the protein docking problem, can be accurately modeled by
minimizing a nonconvex piecewise-quadratic function, a nonconvex underestimator is constructed as the minimum of a finite
number of strictly convex quadratic functions. The nonconvex underestimator is generated by minimizing a linear function on
a reverse convex region and utilizes sample points from a given complex function to be minimized. The global solution of the
piecewise-quadratic underestimator is known exactly and gives an approximation to the global minimum of the original function.
Successive shrinking of the initial search region to which this procedure is applied leads to fairly accurate estimates, within
0.0060%, of the global minima of synthetic nonconvex functions for which the global minima are known. Furthermore, this process
can approximate a nonconvex protein docking function global minimum within four-figure relative accuracy in six refinement
steps. This is less than half the number of refinement steps required by previous models such as the convex kernel underestimator
(Mangasarian et al., Computational Optimization and Applications, to appear) and produces higher accuracy here. 相似文献
3.
This paper describes the construction of convex underestimators for twice continuously differentiable functions over box domains
through piecewise quadratic perturbation functions. A refinement of the classical α BB convex underestimator, the underestimators
derived through this approach may be significantly tighter than the classical αBB underestimator. The convex underestimator
is the difference of the nonconvex function f and a smooth, piecewise quadratic, perturbation function, q. The convexity of the underestimator is guaranteed through an analysis of the eigenvalues of the Hessian of f over all subdomains of a partition of the original box domain. Smoothness properties of the piecewise quadratic perturbation
function are derived in a manner analogous to that of spline construction. 相似文献
4.
In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein–ligand
docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate
the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable
for energy functions with more than one distinct local minimum with a large magnitude. Such functions may contain several
basin-shaped components and, thus, cannot be underfitted by a single convex underestimator. In this paper, we propose using
an underestimator composed of several negative Gaussian functions. Such an underestimator can be computed by solving a nonlinear
programming problem, which minimizes the error between the data points and the underestimator in the L
1 norm. Numerical results for simulated and actual docking energy functions are presented. 相似文献
5.
A global optimization method, QBB, for twice-differentiable NLPs (Non-Linear Programming) is developed to operate within a
branch-and-bound framework and require the construction of a relaxed convex problem on the basis of the quadratic lower bounding
functions for the generic nonconvex structures. Within an exhaustive simplicial division of the constrained region, the rigorous
quadratic underestimation function is constructed for the generic nonconvex function structure by virtue of the maximal eigenvalue
analysis of the interval Hessian matrix. Each valid lower bound of the NLP problem with the division progress is computed
by the convex programming of the relaxed optimization problem obtained by preserving the convex or linear terms, replacing
the concave term with linear convex envelope, underestimating the special terms and the generic terms by using their customized
tight convex lower bounding functions or the valid quadratic lower bounding functions, respectively. The standard convergence
properties of the QBB algorithm for nonconvex global optimization problems are guaranteed. The preliminary computation studies
are presented in order to evaluate the algorithmic efficiency of the proposed QBB approach. 相似文献
6.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
7.
When the follower's optimality conditions are both necessary and sufficient, the nonlinear bilevel program can be solved as a global optimization problem. The complementary slackness condition is usually the complicating constraint in such problems. We show how this constraint can be replaced by an equivalent system of convex and separable quadratic constraints. In this paper, we propose different methods for finding the global minimum of a concave function subject to quadratic separable constraints. The first method is of the branch and bound type, and is based on rectangular partitions to obtain upper and lower bounds. Convergence of the proposed algorithm is also proved. For computational purposes, different procedures that accelerate the convergence of the proposed algorithm are analysed. The second method is based on piecewise linear approximations of the constraint functions. When the constraints are convex, the problem is reduced to global concave minimization subject to linear constraints. In the case of non-convex constraints, we use zero-one integer variables to linearize the constraints. The number of integer variables depends only on the concave parts of the constraint functions.Parts of the present paper were prepared while the second author was visiting Georgia Tech and the University of Florida. 相似文献
8.
This paper presents a canonical dual approach for finding either an optimal or approximate solution to the maximum cut problem (MAX CUT). We show that, by introducing a linear perturbation term to the objective function, the maximum cut problem is perturbed to have a dual problem which is a concave maximization problem over a convex feasible domain under certain conditions. Consequently, some global optimality conditions are derived for finding an optimal or approximate solution. A gradient decent algorithm is proposed for this purpose and computational examples are provided to illustrate the proposed approach. 相似文献
9.
We consider a quadratic d. c. optimization problem on a convex set. The objective function is represented as the difference
of two convex functions. By reducing the problem to the equivalent concave programming problem we prove a sufficient optimality
condition in the form of an inequality for the directional derivative of the objective function at admissible points of the
corresponding level surface. 相似文献
10.
In this paper a deterministic method is proposed for the global optimization of mathematical programs that involve the sum of linear fractional and/or bilinear terms. Linear and nonlinear convex estimator functions are developed for the linear fractional and bilinear terms. Conditions under which these functions are nonredundant are established. It is shown that additional estimators can be obtained through projections of the feasible region that can also be incorporated in a convex nonlinear underestimator problem for predicting lower bounds for the global optimum. The proposed algorithm consists of a spatial branch and bound search for which several branching rules are discussed. Illustrative examples and computational results are presented to demonstrate the efficiency of the proposed algorithm. 相似文献
11.
The subject of this article is a class of global optimization problems, in which the variables can be divided into two groups such that, in each group, the functions involved have the same structure (e.g. linear, convex or concave, etc.). Based on the decomposition idea of Benders (Ref. 1), a corresponding master problem is defined on the space of one of the two groups of variables. The objective function of this master problem is in fact the optimal value function of a nonlinear parametric optimization problem. To solve the resulting master problem, a branch-and-bound scheme is proposed, in which the estimation of the lower bounds is performed by applying the well-known weak duality theorem in Lagrange duality. The results of this article concentrate on two subjects: investigating the convergence of the general algorithm and solving dual problems of some special classes of nonconvex optimization problems. Based on results in sensitivity and stability theory and in parametric optimization, conditions for the convergence are established by investigating the so-called dual properness property and the upper semicontinuity of the objective function of the master problem. The general algorithm is then discussed in detail for some nonconvex problems including concave minimization problems with a special structure, general quadratic problems, optimization problems on the efficient set, and linear multiplicative programming problems. 相似文献
12.
We introduce a new method for solving box-constrained mixed-integer polynomial problems to global optimality. The approach, a specialized branch-and-bound algorithm, is based on the computation of lower bounds provided by the minimization of separable underestimators of the polynomial objective function. The underestimators are the novelty of the approach because the standard approaches in global optimization are based on convex relaxations. Thanks to the fact that only simple bound constraints are present, minimizing the separable underestimator can be done very quickly. The underestimators are computed monomial-wise after the original polynomial has been shifted. We show that such valid underestimators exist and their degree can be bounded when the degree of the polynomial objective function is bounded, too. For the quartic case, all optimal monomial underestimators are determined analytically. We implemented and tested the branch-and-bound algorithm where these underestimators are hardcoded. The comparison against standard global optimization and polynomial optimization solvers clearly shows that our method outperforms the others, the only exception being the binary case where, though, it is still competitive. Moreover, our branch-and-bound approach suffers less in case of dense polynomial objective function, i.e., in case of polynomials having a large number of monomials. This paper is an extended and revised version of the preliminary paper [ 4]. 相似文献
13.
Empirical and theoretical studies of preference structures of investors have long shown that personal and corporate utility
is typically multimodal, implying that the same investor can be risk-averse at certain levels of wealth while risk-seeking
at others. In this paper, we consider the problem of optimizing the portfolio of an investor with an indefinite quadratic
utility function. The convex and concave segments of this utility reflect the investor’s attitude towards risk, which changes
based on deviations from a fixed goal. Uncertainty is modeled via a finite set of scenarios for the returns of securities.
A global optimization approach is developed to solve the proposed nonconvex optimization problem. We present computational
results which investigate the effect of short sales and demonstrate that the proposed approach systematically produces portfolios
with higher values of skewness than the classical expectation-variance approach. 相似文献
14.
Convex underestimators of nonconvex functions, frequently used in deterministic global optimization algorithms, strongly influence their rate of convergence and computational efficiency. A good convex underestimator is as tight as possible and introduces a minimal number of new variables and constraints. Multilinear monomials over a coordinate aligned hyper-rectangular domain are known to have polyhedral convex envelopes which may be represented by a finite number of facet inducing inequalities. This paper describes explicit expressions defining the facets of the convex and concave envelopes of trilinear monomials over a box domain with bounds of opposite signs for at least one variable. It is shown that the previously used approximations based on the recursive use of the bilinear construction rarely yield the convex envelope itself. 相似文献
15.
Recently, optimization algorithms for solving a minimization problem whose objective function is a sum of two convex functions have been widely investigated in the field of image processing. In particular, the scenario when a non-differentiable convex function such as the total variation (TV) norm is included in the objective function has received considerable interests since many variational models encountered in image processing have this nature. In this paper, we propose a fast fixed point algorithm based on the adapted metric method, and apply it in the field of TV-based image deblurring. The novel method is derived from the idea of establishing a general fixed point algorithm framework based on an adequate quadratic approximation of one convex function in the objective function, in a way reminiscent of Quasi-Newton methods. Utilizing the non-expansion property of the proximity operator we further investigate the global convergence of the proposed algorithm. Numerical experiments on image deblurring problem demonstrate that the proposed algorithm is very competitive with the current state-of-the-art algorithms in terms of computational efficiency. 相似文献
16.
A function on Rn with multiple local minima is approximated from below, via linear programming, by a linear combination of convex kernel functions
using sample points from the given function. The resulting convex kernel underestimator is then minimized, using either a
linear equation solver for a linear-quadratic kernel or by a Newton method for a Gaussian kernel, to obtain an approximation
to a global minimum of the original function. Successive shrinking of the original search region to which this procedure is
applied leads to fairly accurate estimates, within 0.0001% for a Gaussian kernel function, relative to global minima of synthetic
nonconvex piecewise-quadratic functions for which the global minima are known exactly. Gaussian kernel underestimation improves
by a factor of ten the relative error obtained using a piecewise-linear underestimator (O.L. Mangasarian, J.B. Rosen, and
M.E. Thompson, Journal of Global Optimization, Volume 32, Number 1, Pages 1–9, 2005), while cutting computational time by
an average factor of over 28. 相似文献
17.
A two level global optimization algorithm for multidimensional scaling (MDS) with city-block metric is proposed. The piecewise quadratic structure of the objective function is employed. At the upper level a combinatorial global optimization problem is solved by means of branch and bound method, where an objective function is defined as the minimum of a quadratic programming problem. The later is solved at the lower level by a standard quadratic programming algorithm. The proposed algorithm has been applied for auxiliary and practical problems whose global optimization counterpart was of dimensionality up to 24. 相似文献
18.
A crucial problem for many global optimization methods is how to handle partition sets whose feasibility is not known. This problem is solved for broad classes of feasible sets including convex sets, sets defined by finitely many convex and reverse convex constraints, and sets defined by Lipschitzian inequalities. Moreover, a fairly general theory of bounding is presented and applied to concave objective functions, to functions representable as differences of two convex functions, and to Lipschitzian functions. The resulting algorithms allow one to solve any global optimization problem whose objective function is of one of these forms and whose feasible set belongs to one of the above classes. In this way, several new fields of optimization are opened to the application of global methods. 相似文献
19.
The paper describes a method for computing a lower bound of the global minimum of an indefinite quadratic form over a simplex. The bound is derived by computing an underestimator of the convex envelope by solving a semidefinite program (SDP). This results in a convex quadratic program (QP). It is shown that the optimal value of the QP is a lower bound of the optimal value of the original problem. Since there exist fast (polynomial time) algorithms for solving SDP's and QP's the bound can be computed in reasonable time. Numerical experiments indicate that the relative error of the bound is about 10 percent for problems up to 20 variables, which is much better than a known SDP bound. 相似文献
20.
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere containing the feasible set. The concave term is obtained either by a constant diagonal shift associated with the smallest eigenvalue of the objective function Hessian, or by a diagonal shift obtained by solving a semidefinite programming problem. Numerical results show that the proposed algorithm is competitive with state-of-the-art graph partitioning codes. 相似文献
|