共查询到20条相似文献,搜索用时 10 毫秒
1.
In this note, we obtain a sufficient and necessary condition for a point to be a local minimizer of a continuous optimization problem with maximin constraints via the local minimizers of its transformed standard nonlinear optimization problem. 相似文献
2.
Harold P. Benson 《Computational Optimization and Applications》2004,27(1):5-22
Convex and concave envelopes play important roles in various types of optimization problems. In this article, we present a result that gives general guidelines for constructing convex and concave envelopes of functions of two variables on bounded quadrilaterals. We show how one can use this result to construct convex and concave envelopes of bilinear and fractional functions on rectangles, parallelograms and trapezoids. Applications of these results to global optimization are indicated. 相似文献
3.
Jeff Linderoth 《Mathematical Programming》2005,103(2):251-282
We propose a branch-and-bound algorithm for solving nonconvex quadratically-constrained quadratic programs. The algorithm is novel in that branching is done by partitioning the feasible region into the Cartesian product of two-dimensional triangles and rectangles. Explicit formulae for the convex and concave envelopes of bilinear functions over triangles and rectangles are derived and shown to be second-order cone representable. The usefulness of these new relaxations is demonstrated both theoretically and computationally. 相似文献
4.
E-Convex Sets, E-Convex Functions, and E-Convex Programming 总被引:34,自引:0,他引:34
E. A. Youness 《Journal of Optimization Theory and Applications》1999,102(2):439-450
A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established. 相似文献
5.
J. W. Bandler 《Journal of Optimization Theory and Applications》1974,14(1):99-114
A possible mathematical formulation of the practical problem of computer-aided design of electrical circuits (for example) and systems and engineering designs in general, subject to tolerances onk independent parameters, is proposed. An automated scheme is suggested, starting from arbitrary initial acceptable or unacceptable designs and culminating in designs which, under reasonable restrictions, are acceptable in the worst-case sense. It is proved, in particular, that, if the region of points in the parameter space for which designs are both feasible and acceptable satisfies a certain condition (less restrictive than convexity), then no more than 2
k
points, the vertices of the tolerance region, need to be considered during optimization.This paper was presented at the 6th Annual Princeton Conference on Information Sciences and Systems, Princeton, New Jersey, 1972. The author has benefitted from practical discussions with J. F. Pinel and K. A. Roberts of Bell-Northern Research. V. K. Jha programmed some numerical examples connected with this work. C. Charalambous, P. C. Liu, and N. D. Markettos have made helpful suggestions. The work was supported by Grant No. A-7239 from the National Research Council of Canada. 相似文献
6.
关于E-凸函数和E-凸规划的错误结论 总被引:6,自引:0,他引:6
最近Youness在文[1]建立了一类E-凸函数和一类E-凸规划,并分析和给出了他们的主要性质。本文通过6个反例说明文[1]关于E-凸函数和E-凸规划的大部分结论是错误的。 相似文献
7.
Harold P. Benson 《Journal of Global Optimization》1999,15(4):315-342
This article presents a new global solution algorithm for Convex Multiplicative Programming called the Outcome Space Algorithm. To solve a given convex multiplicative program (P
D), the algorithm solves instead an equivalent quasiconcave minimization problem in the outcome space of the original problem. To help accomplish this, the algorithm uses branching, bounding and outer approximation by polytopes, all in the outcome space of problem (P
D). The algorithm economizes the computations that it requires by working in the outcome space, by avoiding the need to compute new vertices in the outer approximation process, and, except for one convex program per iteration, by requiring for its execution only linear programming techniques and simple algebra. 相似文献
8.
Yuelin Gao 《Applied mathematics and computation》2010,216(4):1206-1218
In this paper, by solving the relaxed quasiconcave programming problem in outcome space, a new global optimization algorithm for convex multiplicative programming is presented. Two kinds of techniques are employed to establish the algorithm. The first one is outer approximation technique which is applied to shrink relaxation area of quasiconcave programming problem and to compute appropriate feasible points and to raise the capacity of bounding. And the other one is branch and bound technique which is used to guarantee global optimization. Some numerical results are presented to demonstrate the effectiveness and feasibility of the proposed algorithm. 相似文献
9.
Fabio Tardella 《Optimization Letters》2008,2(3):363-375
Convex envelopes are a very useful tool in global optimization. However finding the exact convex envelope of a function is
a difficult task in general. This task becomes considerably simpler in the case where the domain is a polyhedron and the convex
envelope is vertex polyhedral, i.e., has a polyhedral epigraph whose vertices correspond to the vertices of the domain. A further simplification is possible
when the convex envelope is sum decomposable, i.e., the convex envelope of a sum of functions coincides with the sum of the convex envelopes of the summands. In this
paper we provide characterizations and sufficient conditions for the existence of a vertex polyhedral convex envelope. Our
results extend and unify several results previously obtained for special cases of this problem. We then characterize sum decomposability
of vertex polyhedral convex envelopes, and we show, among else, that the vertex polyhedral convex envelope of a sum of functions
coincides with the sum of the vertex polyhedral convex envelopes of the summands if and only if the latter sum is vertex polyhedral. 相似文献
10.
《Journal of Optimization Theory and Applications》2001,109(2):465-474
Journal of Optimization Theory and Applications - 相似文献
11.
《Journal of Optimization Theory and Applications》2000,107(1):195-204
Instructions for Authors
GENERAL INFORMATION 相似文献12.
《Journal of Optimization Theory and Applications》2001,110(1):235-244
Instructions for Authors
GENERAL INFORMATION 相似文献13.
《Journal of Optimization Theory and Applications》2001,111(3):667-676
Instructions for Authors
GENERAL INFORMATION 相似文献14.
《Journal of Optimization Theory and Applications》2000,106(3):691-700
Instructions for Authors
General Information 相似文献15.
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series–parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the approximate solution of the problem. The first algorithm solves at most min{m, ν − n + 1} subproblems; each subproblem has exactly one equality constraint and at most n variables. The second algorithm solves a dynamically generated sequence of subproblems; each subproblem has at most ν − n + 1 equality constraints, where ν is the total number of variables. To solve these subproblems both algorithms use the authors’ Projected Newton Bracketing method for linearly constrained convex minimization, in conjunction with the steepest descent method. We report the results of numerical experiments for both algorithms. 相似文献
16.
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. 相似文献
17.
Conditional Value at Risk (CVaR) is widely used in portfolio optimization as a measure of risk. CVaR is clearly dependent on the underlying probability distribution of the portfolio. We show how copulas can be introduced to any problem that involves distributions and how they can provide solutions for the modeling of the portfolio. We use this to provide the copula formulation of the CVaR of a portfolio. Given the critical dependence of CVaR on the underlying distribution, we use a robust framework to extend our approach to Worst Case CVaR (WCVaR). WCVaR is achieved through the use of rival copulas. These rival copulas have the advantage of exploiting a variety of dependence structures, symmetric and not. We compare our model against two other models, Gaussian CVaR and Worst Case Markowitz. Our empirical analysis shows that WCVaR can asses the risk more adequately than the two competitive models during periods of crisis. 相似文献
18.
The optimization of a linear function on a closed convex set,F, can be stated as a linear semi-infinite program, sinceF is the solution set of (usually) infinite linear inequality systems, the so-called linear representations ofF. The duality properties of these programs are analyzed when the linear representation ofF ranges in some well known classes of linear inequality systems. This paper provides propositions on the duality diagrams of Farkas-Minkowski, canonically closed, compact and closed systems. Converse statements are also given.
Zusammenfassung Die Optimierung einer linearen Funktion auf einer konvexen abgeschlossenen MengeF kann als semi-infinites lineares Programm aufgefaßt werden, daF als Durchschnitt (unendlich) vieler Halbräume dargestellt werden kann. Es werden Dualitätseigenschaften dieser Programme untersucht, wobei von verschiedenen linearen Darstellungen fürF ausgegangen wird. Die Arbeit enthält Sätze über Dualitätsbeziehungen von Farkas-Minkowski, kanonisch abgeschlossene, kompakte und abgeschlossene Systeme. Es werden auch umgekehrte Beziehungen angegeben.相似文献
19.
A class of nonconvex minimization problems can be classified as hidden convex minimization problems. A nonconvex minimization problem is called a hidden convex minimization problem if there exists an equivalent transformation such that the equivalent transformation of it is a convex minimization problem. Sufficient conditions that are independent of transformations are derived in this paper for identifying such a class of seemingly nonconvex minimization problems that are equivalent to convex minimization problems. Thus, a global optimality can be achieved for this class of hidden convex optimization problems by using local search methods. The results presented in this paper extend the reach of convex minimization by identifying its equivalent with a nonconvex representation. 相似文献
20.
We develop a method for generating valid convex quadratic inequalities for mixed0–1 convex programs. We also show how these inequalities can be generated in the linear case by defining cut generation problems using a projection cone. The basic results for quadratic inequalities are extended to generate convex polynomial inequalities. 相似文献