共查询到20条相似文献,搜索用时 15 毫秒
1.
《Optimization》2012,61(3):315-341
In the present paper a connection between cone approximations of sets and generalized differentiability notions will be given. Using both conceptions we present an approach to derive necessary optimality conditions for optimization problems with inequality constraints. Moreover, several constraint qualifications are proposed to get Kuhn-Tucker-type-conditions. 相似文献
2.
S. Tanimoto 《Journal of Optimization Theory and Applications》1980,31(3):331-342
For a convex-concave functionL(x, y), we define the functionf(x) which is obtained by maximizingL with respect toy over a specified set. The minimization problem with objective functionf is considered. We derive necessary conditions of optimality for this problem. Based upon these necessary conditions, we define its dual problem. Furthermore, a duality theorem and a converse duality theorem are obtained. It is made clear that these results are extensions of those derived in studies on a class of nondifferentiable mathematical programming problems.This work was supported by the Japan Society for the Promotion of Sciences. 相似文献
3.
In this paper, necessary optimality conditions in terms of upper and/or lower subdifferentials of both cost and constraint functions are derived for minimax optimization problems with inequality, equality and geometric constraints in the setting of non-differentiatiable and non-Lipschitz functions in Asplund spaces. Necessary optimality conditions in the fuzzy form are also presented. An application of the fuzzy necessary optimality condition is shown by considering minimax fractional programming problem. 相似文献
4.
H. Massam 《Journal of Optimization Theory and Applications》1981,35(4):475-495
The purpose of this paper is to give necessary and sufficient conditions of optimality for a general mathematical programming problem, using not a linear approximation to the constraint function but an approximation possessing certain convexity properties. Such approximations are called sum-convex. Theorems of the alternative involving sum-convex functions are also presented as part of the proof.This work is part of the author's PhD Thesis under the supervision of Professor S. Zlobec at McGill University. 相似文献
5.
《Optimization》2012,61(10):1579-1603
6.
Y. Ishizuka 《Journal of Optimization Theory and Applications》1992,72(1):91-111
This paper is concerned with the optimality for multi-objective programming problems with nonsmooth and nonconvex (but directionally differentiable) objective and constraint functions. The main results are Kuhn-Tucker type necessary conditions for properly efficient solutions and weakly efficient solutions. Our proper efficiency is a natural extension of the Kuhn-Tucker one to the nonsmooth case. Some sufficient conditions for an efficient solution to be proper are also given. As an application, we derive optimality conditions for multi-objective programming problems including extremal-value functions.This work was done while the author was visiting George Washington University, Washington, DC. 相似文献
7.
This note discusses the existence of the directional derivatives of the optimal value functions in a class of nonlinear programming problems and gives the expressions of the directional derivatives. In the study, it is not assumed that the optimal set at the point discussed is not empty. Many well-known results of this area can be derived as special cases of the main theorems of this note.This research was supported by the National Science Foundation of China. The authors would like to thank Professor A. V. Fiacco and the referees for their helpful suggestions. 相似文献
8.
Arthur M. Geoffrion 《Mathematical Programming》1977,13(1):23-37
Mathematical programming applications often require an objective function to be approximated by one of simpler form so that an available computational approach can be used. An a priori bound is derived on the amount of error (suitably defined) which such an approximation can induce. This leads to a natural criterion for selecting the best approximation from any given class. We show that this criterion is equivalent for all practical purposes to the familiar Chebyshev approximation criterion. This gains access to the rich legacy on Chebyshev approximation techniques, to which we add some new methods for cases of particular interest in mathematical programming. Some results relating to post-computational bounds are also obtained.This paper was partially supported by the National Science Foundation and by the Office of Naval Research, and was the basis for a plenary lecture delivered at the IX International Symposium on Mathematical Programming in Budapest, Hungary, August 1976. 相似文献
9.
V. Jeyakumar S. Srisatkunrajah 《Journal of Mathematical Analysis and Applications》2007,335(2):779-788
The Kuhn-Tucker Sufficiency Theorem states that a feasible point that satisfies the Kuhn-Tucker conditions is a global minimizer for a convex programming problem for which a local minimizer is global. In this paper, we present new Kuhn-Tucker sufficiency conditions for possibly multi-extremal nonconvex mathematical programming problems which may have many local minimizers that are not global. We derive the sufficiency conditions by first constructing weighted sum of square underestimators of the objective function and then by characterizing the global optimality of the underestimators. As a consequence, we derive easily verifiable Kuhn-Tucker sufficient conditions for general quadratic programming problems with equality and inequality constraints. Numerical examples are given to illustrate the significance of our criteria for multi-extremal problems. 相似文献
10.
We study the set of admissible (Pareto-optimal) points of a closed, convex setX when preferences are described by a convex, but not necessarily closed, cone. Assuming that the preference cone is strictly supported and making mild assumptions about the recession directions ofX, we extend a representation theorem of Arrow, Barankin, and Blackwell by showing that all admissible points are either limit points of certainstrictly admissible alternatives or translations of such limit points by rays in the closure of the preference cone. We also show that the set of strictly admissible points is connected, as is the full set of admissible points.Relaxing the convexity assumption imposed uponX, we also consider local properties of admissible points in terms of Kuhn-Tucker type characterizations. We specify necessary and sufficient conditions for an element ofX to be a Kuhn-Tucker point, conditions which, in addition, provide local characterizations of strictly admissible points.Several results from this paper were presented in less general form at the National ORSA/TIMS Meeting, Chicago, Illinois, 1975.This research was supported, in part, by the United States Army Research Office (Durham), Grant No. DAAG-29-76-C-0064, and by the Office of Naval Research, Grant No. N00014-67-A-0244-0076. The research of the second author was partially conducted at the Center for Operations Research and Econometrics (CORE), Université Catholique de Louvain, Heverlee, Belgium.The authors are indebted to A. Assad for several helpful discussions and to A. Weiczorek for his careful reading of an earlier version of this paper. 相似文献
11.
《Optimization》2012,61(11):2395-2416
We first discuss some properties of the solution set of a monotone symmetric cone linear complementarity problem (SCLCP), and then consider the limiting behaviour of a sequence of strictly feasible solutions within a wide neighbourhood of central trajectory for the monotone SCLCP. Under assumptions of strict complementarity and Slater’s condition, we provide four different characterizations of a Lipschitzian error bound for the monotone SCLCP in general Euclidean Jordan algebras. Thanks to the observation that a pair of primal-dual convex quadratic symmetric cone programming (CQSCP) problems can be exactly formulated as the monotone SCLCP, thus we obtain the same error bound results for CQSCP as a by-product. 相似文献
12.
《Optimization》2012,61(8):965-979
We extend the smoothing function proposed by Huang, Han and Chen [Journal of Optimization Theory and Applications, 117 (2003), pp. 39–68] for the non-linear complementarity problems to the second-order cone programming (SOCP). Based on this smoothing function, a non-interior continuation method is presented for solving the SOCP. The proposed algorithm solves only one linear system of equations and performs only one line search at each iteration. It is shown that our algorithm is globally and locally superlinearly convergent in absence of strict complementarity at the optimal solution. Numerical results indicate the effectiveness of the algorithm. 相似文献
13.
14.
Y. Ishizuka 《Journal of Optimization Theory and Applications》1988,57(2):341-354
This note is concerned with the generalization of Farkas' theorem and its application to derive optimality conditions for a mix-max problem. Farkas' theorem is generalized to a system of inequalities described by sup-min type positively homogeneous functions. This generalization allows us to deal with optimization problems consisting of objective and constraint functions whose directional derivatives are not necessarily convex with respect to the directions. As an example of such problems, we formulate a min-max problem and derive its optimality conditions.The author would like to express his sincere thanks to Professors S. Suzuki and T. Asano of Sophia University and Professor K. Shimizu of Keio University for encouragement and suggestions. 相似文献
15.
M. Thamban Nair 《Numerical Functional Analysis & Optimization》2013,34(1-2):69-73
Schock (1985) has considered the convergence properties of various Galerkin-like methods for the approximate solution of the operator equation of the second kind x - Tx = y, where T is a bounded linear operator on a Banach space X, and x and y belong to X, and proved that the classical Galerkin method and in certain cases, the iterated Galerkin method are arbitrarily slowly convergent whereas the Kantororich method studied by him is uniformly convergent. It is the purpose of this paper to introduce a general class of approximations methods for x - Tx = y which includes the well-known methods of projection and the quadrature methods, and to characterize its uniform convergence, so that an arbitrarily slowly convergent method can be modified to obtain a uniformly convergent method. 相似文献
16.
This survey is concerned with necessary and sufficient optimality conditions for smooth nonlinear programming problems with inequality and equality constraints. These conditions deal with strict local minimizers of order one and two and with isolated minimizers. In most results, no constraint qualification is required. The optimality conditions are formulated in such a way that the gaps between the necessary and sufficient conditions are small and even vanish completely under mild constraint qualifications.This paper is dedicated to the memory of W. Wetterling.The authors would like to thank Wolfgang Wetterling and Frank Twilt for fruitful discussions and an anonymous referee for many valuable comments. 相似文献
17.
Necessary conditions for optimal control problems with state-control variable inequality constraints are obtained via mathematical programming formulation and functional analysis in Banach space. These conditions are general ones that hold without any constraint qualifications but differentiability. Furthermore, these conditions are shown to be equivalent to the classical result in the presence of the linear independence constraint qualification. 相似文献
18.
19.
Conditions for the uniqueness of the optimal solution in linear semi-infinite programming 总被引:1,自引:0,他引:1
In this paper, we establish different conditions for the uniqueness of the optimal solution of a semi-infinite programming problem. The approach here is based on the differentiability properties of the optimal value function and yields the corresponding extensions to the general linear semi-infinite case of many results provided by Mangasarian and others. In addition, detailed optimality conditions for the most general problem are supplied, and some features of the optimal set mapping are discussed. Finally, we obtain a dimensional characterization of the optimal set, provided that a usual closedness condition (Farkas-Minkowski condition) holds. 相似文献
20.
《Optimization》2012,61(3):433-446
In this article, firstly, a generalized cone subconvexlike set-valued map involving the relative algebraic interior is introduced in ordered linear spaces. Secondly, some properties of a generalized cone subconvexlike set-valued map are investigated. Finally, the optimality conditions of set-valued optimization problem are established. 相似文献