Global Optimality Conditions for Optimization Problems
|
|
- Agatha Gibson
- 5 years ago
- Views:
Transcription
1 The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp Global Optimality Conditions for Optimization Problems Zhiyou Wu 1,2, 1 School of Mathematics and Computer Science, Chongqing Normal University, Chongqing , China 2 Current address: Institute for Statistics and Mathematical Economic Theory, University of Karlsruhe, Karlsruhe, Germany. Abstract We establish new necessary and sufficient optimality conditions for optimization problems. In particular, we establish tractable optimality conditions for the problems of minimizing a weakly convex or concave function subject to standard constraints, such as box constraints, binary constraints, and simplex constraints. Our main theoretical tool for establishing these optimality conditions is abstract convexity. Keywords Global optimization; optimality conditions; abstract convexity. 1 Introduction We study optimality conditions for some classes of global minimization problems. References [1]-[3] and [6, 7, 12], etc. study global optimality conditions for the problems with quadratic objective function subject to either box constraints, binary constraints, quadratic constraints, or linear constraints. In the present paper, we follow the approach of references [2, 3, 9, 12, 13], abstract convexity is used in order to obtain new optimality conditions for global optimization problems. These optimality conditions are expressed in terms of abstract subdifferential (L-subdifferential) and abstract normal cone (L-normal cone). The present paper extends the existing optimality conditions to the necessary and sufficient optimality condition for a general global optimization problem: (P) min f (x), f : x U Rn R {+ },U dom f. This necessary and sufficient condition given in this paper is expressed in terms of (ε,l)- subdifferential and (ε,l)-normal set (see Theorem 1), which extends classical results expressed in terms of ε-subdifferential and ε-normal cone in the sense of convex analysis for concave minimization problems, which can be found in [1, 11] (see Corollary 3.1). Our analysis allows us to obtain some tractable optimality conditions for the classes of problems the objective function is a weakly convex or concave function subject to arbitrary constraint set. A function f is a weakly convex (or concave ) function if This research was partially supported by Alexander von Humboldt Foundation. Corresponding author. zhiyouwu@263.net.
2 378 The 7th International Symposium on Operations Research and Its Applications and only if it can be represented as the sum of a quadratic function and a convex (or concave) function. These classes of functions are broad enough ( see Section 4). So it always not easy to get some tractable global optimality conditions for weakly convex (or concave) problems. Reference [13] gives some sufficient conditions for some special classes of weakly convex programming problems. The present paper gives more stronger sufficient optimality conditions for general weakly convex problems, which extends the results given in [13]. The present paper also gives some necessary optimality conditions for general weakly concave problems (see Theorem 13), which are new results given in this paper. The lay-out of the paper is as follows. Section 2 provides a necessary and sufficient condition in terms of (ε, L)-subdifferential and (ε, L)-normal set. Some sufficient and/or necessary conditions in terms of L-subdifferential and L-normal cone are also presented in Section 2. Section 3 provides sufficient global optimality conditions for the class of problems the objective function a weakly convex function. Section 4 provides necessary optimality conditions for the class of problems the objective function is a weakly concave function. We use the following notation: R n is the n-dimensional Euclidean space; R n + is the n-dimensional non-negative Euclidean space, i.e., R n + := {(x 1,...,x n ) R n x i 0,i = 1,...,n}; u,v stands for the inner product of vectors u and v; S n is the set of symmetric n n matrices; Diag(q) is a diagonal matrix with the diagonal q; A B means that the matrix A B is positive semidefinite. f (x) and ε f (x) are the subdifferential and ε-subdifferential respectively of a convex function f at a point x in the sense of convex analysis. N U (x) and NU ε (x) are the normal cone and ε-normal set respectively of a convex set U at a point x in the sense of convex analysis. 2 Necessary and sufficient conditions for global optimality In this section we first give some preliminaries from abstract convexity (see [5, 8, 10]). Let X be a set and H be a set of functions h : X R. Let L be a set of functions defined on R n. For a function f : R n R {+ } and a point x dom f = {x R n : f (x) < + } define L-subdifferential L f ( x) of f at x by L f ( x) = {l L : f (x) f ( x) + l(x) l( x), x R n }. For ε 0, define (ε,l)-subdifferential ε,l f ( x) of f at x by ε,l f ( x) = {l L : f (x) f ( x) + l(x) l( x) ε, x R n }. Obviously, L f ( x) ε,l f ( x), for any ε 0.
3 Global Optimality Conditions for Optimization Problems 379 Let U R n and let x U. The L-normal set and the (ε,l) normal set of U at x are defined as follows: and N L,U ( x) = {l L : l(x) l( x), x U} N ε L,U( x) = {l L : l(x) l( x) + ε, x U}. If L is a cone, that is, (l L,λ > 0) = (λl L) then N L,U ( x) is also a cone. Since the set L we consider is always a subspace(in particular, a cone), we will use the usual term L- normal cone instead of L-normal set. Properties of (ε, L)-subdifferential (L-subdifferential) and (ε,l)-normal set (L-normal set) have been investigated in ([4, 8]). L-subdifferentials ((ε, L)-subdifferentials) and L-normal cones ((ε, L)-normal sets) are main tools for deriving global optimality conditions for a global minimizer. In other words L := {l : l = 12 } Qx,x + β,x with Q = Diag(q); q,β Rn. (1) We call L the subset of L which consists of functions l(x) = α x 2 + β,x with α R. We now give a necessary and sufficient global optimality condition with (ε,l)-subdifferential and (ε,l)-normal set for the following general global optimization problem (P), which extends the necessary and sufficient global optimality conditions given with ε-subdifferential of convex functions and ε-normal set of convex sets for concave minimization problems (see [1, 11]): (P) minimize f (x) subject to x U, f : R n R {+ } and U dom f = {x R n : f (x) < + }. Theorem 1. Let L be a subspace of real-valued functions defined on R n. Let x U. Suppose that f is H L -convex on U. Then x is a global minimizer of problem (P) if and only if ε,l ( f )( x) N ε L,U( x), ε > 0, (2) H L = {l(x) + c l L,c R}. (3) Here we give a necessary and sufficient global optimality condition for the general optimization problem (P) in terms of (ε, L)-subdifferentials and (ε, L)-normal set. If U is convex and f (x) is concave on U, then the following results which can be found in [1, 11] can be reduced from Theorem 1. Corollary 2. Let x U. Suppose that U is a convex set and f is a concave function on U. Then x is a global minimizer of problem (P) if and only if ε ( f )( x) N ε U( x), ε > 0. (4)
4 380 The 7th International Symposium on Operations Research and Its Applications Remark 1. From Theorem 1, we can also obtain the following results: Let L be a subspace of real-valued functions defined on R n. Let x U. (i). If x is a global minimizer of problem (P), then ε,l ( f )( x) N ε L,U( x), ε 0; (5) (ii). If for any x U, L ( f )(x) /0, then x is a global minimizer of problem (P) if and only if (5) holds. Indeed, from the first part of the proof of Theorem 1 (for the necessary condition), we know that if x is a global minimizer of problem (P), then (5) holds, f does not require to be H L -convex on U. Since L ( f )(x) /0, x U implies that f is H L -convex on U, (ii) can be obtained directly from Theorem 1. In general, it is very difficult to calculate the (ε, L)-subdifferential and the (ε, L)- normal set for general function f and general set U, and even if f and U are convex, it is also very difficult to calculate the ε-subdifferential and the ε-normal set in the sense of convex analysis. But, for some kinds of functions f and for some kinds of sets U, we can calculate the L-subdifferential and the L-normal cone. The following simple results will be useful in the sequel. Corollary 3. (Necessary Condition) Let L be a subspace of real-valued functions defined on R n. Let x U. If x is a global minimizer of problem (P), then L ( f )( x) N L,U ( x). (6) The following sufficient condition has been presented in [2, 3], which study sufficient conditions for quadratic functions over binary or/and box sets. Proposition 4. (Sufficient Condition) Let L be a subspace of real-valued functions defined on R n. Let x U. If ( L f ( x) ) N L,U ( x) /0 (7) then x is a global minimizer of problem (P). Corollary 3 and Proposition 4 imply that ( L f ( x) ) N L,U ( x) /0 = ε,l ( f )( x) N ε L,U( x), ε > 0. Generally, there is a gap between the sufficient condition (7) and the necessary condition (6). But in some cases, both of (7) and (6) are necessary and sufficient conditions. In Section 7, we will see that if f is a quadratic function, then the sufficient condition (7) and the necessary condition (6) are equivalent in some sense. Proposition 5. Let L be a subspace of real-valued functions defined on R n, x U. If f L, then ( ) L f ( x) N L,U ( x) /0 f N L,U ( x) L ( f )( x) N L,U ( x). (8) Condition (8) means that if f L, both of (7) and (6) are necessary and sufficient conditions.
5 Global Optimality Conditions for Optimization Problems Sufficient Conditions for Weakly Convex Problems Consider problem U dom f, (P 1 ) minimize f (x) subject to x U, with A 0 S n and p is a proper convex function. f (x) = 1 2 A 0x,x + p(x), (9) Proposition 6. Let f be a function defined by (9). Let x dom p, the domain of p. Then L f ( x) {l L l(x) = 1 2 Qx,x + β,x : A 0 Q 0,(Q A 0 ) x + β p( x)}. (10) Corollary 7. Let f (x) = 1 2 A 0x,x + a 0,x be a quadratic function. Then L f ( x) = {l L l(x) = 1 2 Qx,x + β,x : A 0 Q 0,β = a 0 + (A 0 Q) x}.(11) Theorem 8. Let U R n and x U. If [SC1] q, b R n such that A 0 Diag(q), b A 0 x p( x) and l q,b, x N L,U( x). Then x is a global minimizer of problem (P 1 ). Corollary 9. Let f be a quadratic function, f (x) = 1 2 A 0x,x + a 0,x. If [SCQ1] q R n such that A 0 Diag(q), b = a 0 + A 0 x and l q,b, x N L,U( x), then x is a global minimizer of problem (P 1 ). Furthermore, ( ) [SCQ1] L f ( x) N L,U( x) /0. We can obtain tractable sufficient conditions if the normal cone N L,U( x) can be easily calculated, in particular, if U is one of the following sets, then we have the following results: Corollary 10. Let U = n i=1 {u i,v i } and x U. If there exist q,b R n such that A 0 Diag(q) and b A 0 x p( x) and Xb 1 Diag(q)(v u), 2 x i : = 0 if x i = u i = v i 1 if x i = u i 1 if x i = v i X : = Diag( x 1,..., x n ) (12) and v = (v 1,...,v n ),u = (u 1,...,u n ), then x is a global minimizer of problem (P 1 ).
6 382 The 7th International Symposium on Operations Research and Its Applications Corollary 11. Let U = {x = (x 1,...,x n ) : u i x i v i } and x U. If there exist q,b R n such that A 0 Diag(q) and b A 0 x p( x) and X b b 1 2 Q (v u)}, x i (b) : = 0 if x i = u i = v i 1 if x i = u i < v i 1 if x i = v i > u i b i if x i (u i,v i ) X b : = Diag( x 1 (b),..., x n (b)) (13) and v = (v 1,...,v n ),u = (u 1,...,u n ), then x is a global minimizer of problem (P 1 ). Corollary 12. Let U = co{v 1,...,v k },k n + 1 be a simplex in R n and x U. If there exist q,b R n such that A 0 Diag(q), b A 0 x p( x) and then x is a global minimizer of problem (P). max i=1,...,k h q,b (v i) min x U h+ q,b (x), (14) 4 Necessary Conditions for Weakly Concave Problems Consider the problem (P 2 ) minimize f (x) subject to x U, U dom f, f (x) = 1 2 A 0x,x + p(x), with A 0 S n and p is a proper concave function. A function f is called to be a weakly concave function if f is a weakly convex function. Theorem 13. Let U R n, x U. If x is a global minimizer of problem (P 2 ), then [NC1] l q,b, x N L,U( x) for any q,b R n with Diag(q) A 0,A 0 x b ( p)( x), Q = Diag(q). l q,b, x (x) := 1 2 n i=1 q i x 2 i + n i=1 b i x i n i=1 q i x i x i = 1 Qx,x + b Q x,x, (15) 2 We can derive some necessary conditions for the following optimization problems (QP) with quadratic objective functions: (QP) minimize f (x) subject to x U, (16) f (x) := 1 2 A 0x,x + a 0,x, and U R n.
7 Global Optimality Conditions for Optimization Problems 383 Corollary 14. Let U R n, x U. If x is a global minimizer of problem (QP), then [NCQ1] l q,b, x N L,U( x) for any q R n with Diag(q) A 0,b = a 0 + A 0 x. Furthermore, [NCQ1] L( f )( x) N L,U( x). Remark 2. For quadratic problem (QP), conditions [SCQ1],[NCQ1] and [NCQ2] have the following relationships: [SCQ1] = [NCQ1], and [NCQ1] from Remark 7.1 = [SCQ1] = [NCQ2], but [NCQ2] [SCQ1] [NCQ1] from Remark 7.1 = If U = U( x) = n i=1 U i( x) for x U, then Acknowledgments [SCQ1] [NCQ2], but [NCQ2] [NCQ1]. [NCQ2] = [NCQ1]. The authors are very thankful to Professor A. M. Rubinov who made some helpful suggestions for this paper. References [1] J. B. Hiriart-Urruty and C. Lemarechal, Testing necessary and sufficient conditions for global optimality in the problem of maximizing a convex quadratic over a convex polyhedron, Preliminary report, Seminar of Numerical Analysis, University Paul Sabatier, Toulouse, [2] V. Jeyakumar, A. M. Rubinov, Z.Y. Wu. Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, Journal of Global Optimization, 36(3), , [3] V. Jeyakumar, A. M. Rubinov, Z.Y. Wu. Global Optimality Conditions for Non-convex Quadratic Minimization Problems with Quadratic Constraints, Mathematical Programming, Series A, 110, , [4] V. Jeyakumar, A. M. Rubinov, Z.Y. Wu. Generalized Fenchel s Conjugation Formula and Duality for Abstract Convex Functions, Journal of Optimization Theory and Applications, 132, , [5] D. Pallaschke and S. Rolewicz, Foundations of Mathematical Optimization, Kluwer Academic Publishers, Dordrecht, [6] J.M. Peng and Y. Yuan, Optimization conditions for the minimization of a quadratic with two quadratic constraints, SIAM J. Optim. 7(3) (1997), [7] M. C. Pinar, Sufficient global optimality conditions for bivalent quadratic optimization, J. Optim. Theor. Appl., 122(2) (2004), [8] A. M Rubinov, Abstract Convexity and Global Optimization, Kluwer Academic Publishers, 2000.
8 384 The 7th International Symposium on Operations Research and Its Applications [9] A.M. Rubinov, Z. Y. Wu, Optimality conditions in global optimization and their applications, Mathematical Programming, Series B, Published online: [10] I. Singer, Abstract convex analysis, John Wiley & Sons, Inc., New York, [11] H. Tuy, Convex Analysis and Global Optimization, Kluwer Academic publishers, Dordrecht/Boston/London, [12] Z.Y. Wu, V. Jeyakumar, A. M. Rubinov, Sufficient Conditions for Globally Optimality of Bivalent Nonconvex Quadratic Programs, Journal of Optimization Theory and Applications,133, , [13] Z.Y. Wu, Sufficient Global Optimality Conditions for Weakly Convex Minimization Problems, Journal of Global Optimization, 39(3), , 2007.
Optimality conditions in global optimization and their applications
Math. Program., Ser. B DOI 0.007/s007-007-042-4 FULL LENGTH PAPER Optimality conditions in global optimization and their applications A. M. Rubinov Z. Y. Wu Received: 5 September 2005 / Accepted: 5 January
More informationGlobal Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Guoyin Li Communicated by X.Q. Yang Abstract In this paper, we establish global optimality
More informationGlobal Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints
Journal of Global Optimization 21: 445 455, 2001. 2001 Kluwer Academic Publishers. Printed in the Netherlands. 445 Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic
More informationA Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials
A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials G. Y. Li Communicated by Harold P. Benson Abstract The minimax theorem for a convex-concave bifunction is a fundamental theorem
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
More informationMustafa Ç. Pinar 1 and Marc Teboulle 2
RAIRO Operations Research RAIRO Oper. Res. 40 (2006) 253 265 DOI: 10.1051/ro:2006023 ON SEMIDEFINITE BOUNDS FOR MAXIMIZATION OF A NON-CONVEX QUADRATIC OBJECTIVE OVER THE l 1 UNIT BALL Mustafa Ç. Pinar
More informationNonlinear Optimization Subject to a System of Fuzzy Relational Equations with Max-min Composition
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 1 9 Nonlinear Optimization Subject to
More informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
More informationResearch Article A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, Article ID 203467, 6 pages http://dx.doi.org/10.1155/2014/203467 Research Article A Note on Optimality Conditions for DC Programs Involving Composite Functions Xiang-Kai
More informationResearch Article Existence and Duality of Generalized ε-vector Equilibrium Problems
Applied Mathematics Volume 2012, Article ID 674512, 13 pages doi:10.1155/2012/674512 Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Hong-Yong Fu, Bin Dan, and Xiang-Yu
More informationII KLUWER ACADEMIC PUBLISHERS. Abstract Convexity and Global Optimization. Alexander Rubinov
Abstract Convexity and Global Optimization by Alexander Rubinov School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia II KLUWER ACADEMIC PUBLISHERS DORDRECHT
More informationSequential Pareto Subdifferential Sum Rule And Sequential Effi ciency
Applied Mathematics E-Notes, 16(2016), 133-143 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Sequential Pareto Subdifferential Sum Rule And Sequential Effi ciency
More informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationAbstract Monotone Operators Representable by Abstract Convex Functions
Applied Mathematical Sciences, Vol. 6, 2012, no. 113, 5649-5653 Abstract Monotone Operators Representable by Abstract Convex Functions H. Mohebi and A. R. Sattarzadeh Department of Mathematics of Shahid
More informationCANONICAL DUAL APPROACH TO SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS. Shu-Cherng Fang. David Yang Gao. Ruey-Lin Sheu. Soon-Yi Wu
JOURNAL OF INDUSTRIAL AND Website: http://aimsciences.org MANAGEMENT OPTIMIZATION Volume 4, Number 1, February 2008 pp. 125 142 CANONICAL DUAL APPROACH TO SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS Shu-Cherng
More informationON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION
ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily
More informationCONVEX OPTIMIZATION VIA LINEARIZATION. Miguel A. Goberna. Universidad de Alicante. Iberian Conference on Optimization Coimbra, November, 2006
CONVEX OPTIMIZATION VIA LINEARIZATION Miguel A. Goberna Universidad de Alicante Iberian Conference on Optimization Coimbra, 16-18 November, 2006 Notation X denotes a l.c. Hausdorff t.v.s and X its topological
More informationCharacterizations of the solution set for non-essentially quasiconvex programming
Optimization Letters manuscript No. (will be inserted by the editor) Characterizations of the solution set for non-essentially quasiconvex programming Satoshi Suzuki Daishi Kuroiwa Received: date / Accepted:
More informationA Dual Condition for the Convex Subdifferential Sum Formula with Applications
Journal of Convex Analysis Volume 12 (2005), No. 2, 279 290 A Dual Condition for the Convex Subdifferential Sum Formula with Applications R. S. Burachik Engenharia de Sistemas e Computacao, COPPE-UFRJ
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationVictoria Martín-Márquez
A NEW APPROACH FOR THE CONVEX FEASIBILITY PROBLEM VIA MONOTROPIC PROGRAMMING Victoria Martín-Márquez Dep. of Mathematical Analysis University of Seville Spain XIII Encuentro Red de Análisis Funcional y
More informationOn Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 18, 891-898 HIKARI Ltd, www.m-hikari.com On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials Jaddar Abdessamad Mohamed
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics MONOTONE TRAJECTORIES OF DYNAMICAL SYSTEMS AND CLARKE S GENERALIZED JACOBIAN GIOVANNI P. CRESPI AND MATTEO ROCCA Université de la Vallée d Aoste
More informationA CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received
More informationGlobal Maximum of a Convex Function: Necessary and Sufficient Conditions
Journal of Convex Analysis Volume 13 2006), No. 3+4, 687 694 Global Maximum of a Convex Function: Necessary and Sufficient Conditions Emil Ernst Laboratoire de Modélisation en Mécaniue et Thermodynamiue,
More informationSECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS
Journal of Applied Analysis Vol. 9, No. 2 (2003), pp. 261 273 SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS I. GINCHEV and V. I. IVANOV Received June 16, 2002 and, in revised form,
More informationSOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS
APPLICATIONES MATHEMATICAE 22,3 (1994), pp. 419 426 S. G. BARTELS and D. PALLASCHKE (Karlsruhe) SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS Abstract. Two properties concerning the space
More informationLECTURE 13 LECTURE OUTLINE
LECTURE 13 LECTURE OUTLINE Problem Structures Separable problems Integer/discrete problems Branch-and-bound Large sum problems Problems with many constraints Conic Programming Second Order Cone Programming
More informationSOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS
Applied Mathematics E-Notes, 5(2005), 150-156 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ SOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS Mohamed Laghdir
More informationConvexification by Duality for a Leontief Technology Production Design Problem
Vietnam Journal of Mathematics 35:3(2007) 299 308 9LHWQDP-RXUQDO RI 0$7+(0$7,&6 9$67 Convexification by Duality for a Multiple Leontief Technology Production Design Problem P. T. Thach Institute of Mathematics,
More informationPOLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationA SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES
A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES Francisco Facchinei 1, Andreas Fischer 2, Christian Kanzow 3, and Ji-Ming Peng 4 1 Università di Roma
More informationExtended Monotropic Programming and Duality 1
March 2006 (Revised February 2010) Report LIDS - 2692 Extended Monotropic Programming and Duality 1 by Dimitri P. Bertsekas 2 Abstract We consider the problem minimize f i (x i ) subject to x S, where
More informationA Note on KKT Points of Homogeneous Programs 1
A Note on KKT Points of Homogeneous Programs 1 Y. B. Zhao 2 and D. Li 3 Abstract. Homogeneous programming is an important class of optimization problems. The purpose of this note is to give a truly equivalent
More informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationNecessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces
Laboratoire d Arithmétique, Calcul formel et d Optimisation UMR CNRS 6090 Necessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces Emil
More informationStrong Convergence Theorem by a Hybrid Extragradient-like Approximation Method for Variational Inequalities and Fixed Point Problems
Strong Convergence Theorem by a Hybrid Extragradient-like Approximation Method for Variational Inequalities and Fixed Point Problems Lu-Chuan Ceng 1, Nicolas Hadjisavvas 2 and Ngai-Ching Wong 3 Abstract.
More informationA Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems
A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems Gábor Pataki gabor@unc.edu Dept. of Statistics and OR University of North Carolina at Chapel Hill Abstract The Facial Reduction
More informationConvex Analysis and Economic Theory Fall 2018 Winter 2019
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 18: Differentiability 18.1 Differentiable functions In this section I want
More informationA Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions
The First International Symposium on Optimization and Systems Biology (OSB 07) Beijing, China, August 8 10, 2007 Copyright 2007 ORSC & APORC pp. 405 411 A Trust Region Algorithm Model With Radius Bounded
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming
E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program
More informationThe Trust Region Subproblem with Non-Intersecting Linear Constraints
The Trust Region Subproblem with Non-Intersecting Linear Constraints Samuel Burer Boshi Yang February 21, 2013 Abstract This paper studies an extended trust region subproblem (etrs in which the trust region
More informationThe Equilibrium Equivalent Representation for Variational Inequalities Problems with Its Application in Mixed Traffic Flows
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 119 124 The Equilibrium Equivalent Representation
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 4, Issue 4, Article 67, 2003 ON GENERALIZED MONOTONE MULTIFUNCTIONS WITH APPLICATIONS TO OPTIMALITY CONDITIONS IN
More informationPermanently Going Back and Forth between the Quadratic World and the Convexity World in Optimization
Appl Math Optim 45:169 184 (00) DOI: 10.1007/s0045-001-0034-6 00 Springer-Verlag New York Inc. Permanently Going Back and Forth between the Quadratic World and the Convexity World in Optimization J.-B.
More informationMustapha Ç. Pinar 1. Communicated by Jean Abadie
RAIRO Operations Research RAIRO Oper. Res. 37 (2003) 17-27 DOI: 10.1051/ro:2003012 A DERIVATION OF LOVÁSZ THETA VIA AUGMENTED LAGRANGE DUALITY Mustapha Ç. Pinar 1 Communicated by Jean Abadie Abstract.
More informationWEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE
Fixed Point Theory, Volume 6, No. 1, 2005, 59-69 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.htm WEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE YASUNORI KIMURA Department
More informationThe sum of two maximal monotone operator is of type FPV
CJMS. 5(1)(2016), 17-21 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 The sum of two maximal monotone operator is of type
More informationSome Properties of the Augmented Lagrangian in Cone Constrained Optimization
MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented
More informationResearch Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007
Computer and Automation Institute, Hungarian Academy of Sciences Research Division H-1518 Budapest, P.O.Box 63. ON THE PROJECTION ONTO A FINITELY GENERATED CONE Ujvári, M. WP 2007-5 August, 2007 Laboratory
More informationRanks of Real Symmetric Tensors
Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationOptimization for Machine Learning
Optimization for Machine Learning (Problems; Algorithms - A) SUVRIT SRA Massachusetts Institute of Technology PKU Summer School on Data Science (July 2017) Course materials http://suvrit.de/teaching.html
More informationSTABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES
STABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES CHONG LI, DONGHUI FANG, GENARO LÓPEZ, AND MARCO A. LÓPEZ Abstract. We consider the optimization problem (P A )
More informationOn the projection onto a finitely generated cone
Acta Cybernetica 00 (0000) 1 15. On the projection onto a finitely generated cone Miklós Ujvári Abstract In the paper we study the properties of the projection onto a finitely generated cone. We show for
More informationRelationships between upper exhausters and the basic subdifferential in variational analysis
J. Math. Anal. Appl. 334 (2007) 261 272 www.elsevier.com/locate/jmaa Relationships between upper exhausters and the basic subdifferential in variational analysis Vera Roshchina City University of Hong
More informationResearch Article Optimality Conditions of Vector Set-Valued Optimization Problem Involving Relative Interior
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2011, Article ID 183297, 15 pages doi:10.1155/2011/183297 Research Article Optimality Conditions of Vector Set-Valued Optimization
More informationNew formulas for the Fenchel subdifferential of the conjugate function
New formulas for the Fenchel subdifferential of the conjugate function Rafael Correa, Abderrahim Hantoute Centro de Modelamiento Matematico, Universidad de Chile (CNRS UMI 2807), Avda Blanco Encalada 2120,
More informationRobust Farkas Lemma for Uncertain Linear Systems with Applications
Robust Farkas Lemma for Uncertain Linear Systems with Applications V. Jeyakumar and G. Li Revised Version: July 8, 2010 Abstract We present a robust Farkas lemma, which provides a new generalization of
More informationA Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions
A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions Angelia Nedić and Asuman Ozdaglar April 15, 2006 Abstract We provide a unifying geometric framework for the
More informationCONTINUOUS CONVEX SETS AND ZERO DUALITY GAP FOR CONVEX PROGRAMS
CONTINUOUS CONVEX SETS AND ZERO DUALITY GAP FOR CONVEX PROGRAMS EMIL ERNST AND MICHEL VOLLE ABSTRACT. This article uses classical notions of convex analysis over euclidean spaces, like Gale & Klee s boundary
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationCharacterizing Robust Solution Sets of Convex Programs under Data Uncertainty
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty V. Jeyakumar, G. M. Lee and G. Li Communicated by Sándor Zoltán Németh Abstract This paper deals with convex optimization problems
More informationMaximal monotonicity for the precomposition with a linear operator
Maximal monotonicity for the precomposition with a linear operator Radu Ioan Boţ Sorin-Mihai Grad Gert Wanka July 19, 2005 Abstract. We give the weakest constraint qualification known to us that assures
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationarxiv: v1 [math.oc] 17 Oct 2017
Noname manuscript No. (will be inserted by the editor) Saddle representations of positively homogeneous functions by linear functions Valentin V. Gorokhovik Marina Trafimovich arxiv:1710.06133v1 [math.oc]
More informationLECTURE 12 LECTURE OUTLINE. Subgradients Fenchel inequality Sensitivity in constrained optimization Subdifferential calculus Optimality conditions
LECTURE 12 LECTURE OUTLINE Subgradients Fenchel inequality Sensitivity in constrained optimization Subdifferential calculus Optimality conditions Reading: Section 5.4 All figures are courtesy of Athena
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationConvex Optimization. Dani Yogatama. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA. February 12, 2014
Convex Optimization Dani Yogatama School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA February 12, 2014 Dani Yogatama (Carnegie Mellon University) Convex Optimization February 12,
More informationIntroduction to Nonlinear Stochastic Programming
School of Mathematics T H E U N I V E R S I T Y O H F R G E D I N B U Introduction to Nonlinear Stochastic Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio SPS
More information1 Introduction Semidenite programming (SDP) has been an active research area following the seminal work of Nesterov and Nemirovski [9] see also Alizad
Quadratic Maximization and Semidenite Relaxation Shuzhong Zhang Econometric Institute Erasmus University P.O. Box 1738 3000 DR Rotterdam The Netherlands email: zhang@few.eur.nl fax: +31-10-408916 August,
More informationOptimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces Zhi-Ang Zhou a, Xin-Min Yang b and Jian-Wen Peng c1 a Department of Applied Mathematics,
More informationConvex analysis and profit/cost/support functions
Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m Convex analysts may give one of two
More information1 Introduction CONVEXIFYING THE SET OF MATRICES OF BOUNDED RANK. APPLICATIONS TO THE QUASICONVEXIFICATION AND CONVEXIFICATION OF THE RANK FUNCTION
CONVEXIFYING THE SET OF MATRICES OF BOUNDED RANK. APPLICATIONS TO THE QUASICONVEXIFICATION AND CONVEXIFICATION OF THE RANK FUNCTION Jean-Baptiste Hiriart-Urruty and Hai Yen Le Institut de mathématiques
More informationDUALITY AND FARKAS-TYPE RESULTS FOR DC INFINITE PROGRAMMING WITH INEQUALITY CONSTRAINTS. Xiang-Kai Sun*, Sheng-Jie Li and Dan Zhao 1.
TAIWANESE JOURNAL OF MATHEMATICS Vol. 17, No. 4, pp. 1227-1244, August 2013 DOI: 10.11650/tjm.17.2013.2675 This paper is available online at http://journal.taiwanmathsoc.org.tw DUALITY AND FARKAS-TYPE
More informationConvex Sets Strict Separation in Hilbert Spaces
Applied Mathematical Sciences, Vol. 8, 2014, no. 64, 3155-3160 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.44257 Convex Sets Strict Separation in Hilbert Spaces M. A. M. Ferreira 1
More informationStability of efficient solutions for semi-infinite vector optimization problems
Stability of efficient solutions for semi-infinite vector optimization problems Z. Y. Peng, J. T. Zhou February 6, 2016 Abstract This paper is devoted to the study of the stability of efficient solutions
More informationThai Journal of Mathematics Volume 14 (2016) Number 1 : ISSN
Thai Journal of Mathematics Volume 14 (2016) Number 1 : 53 67 http://thaijmath.in.cmu.ac.th ISSN 1686-0209 A New General Iterative Methods for Solving the Equilibrium Problems, Variational Inequality Problems
More informationVector Variational Principles; ε-efficiency and Scalar Stationarity
Journal of Convex Analysis Volume 8 (2001), No. 1, 71 85 Vector Variational Principles; ε-efficiency and Scalar Stationarity S. Bolintinéanu (H. Bonnel) Université de La Réunion, Fac. des Sciences, IREMIA,
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More informationALGORITHMS FOR MINIMIZING DIFFERENCES OF CONVEX FUNCTIONS AND APPLICATIONS
ALGORITHMS FOR MINIMIZING DIFFERENCES OF CONVEX FUNCTIONS AND APPLICATIONS Mau Nam Nguyen (joint work with D. Giles and R. B. Rector) Fariborz Maseeh Department of Mathematics and Statistics Portland State
More informationON DIFFERENCE CONVEXITY OF LOCALLY LIPSCHITZ FUNCTIONS (PREPARED FOR OPTIMIZATION IN HONOUR OF ALFREDO IUSEM S SIXTIETH BIRTHDAY)
ON DIFFERENCE CONVEXITY OF LOCALLY LIPSCHITZ FUNCTIONS (PREPARED FOR OPTIMIZATION IN HONOUR OF ALFREDO IUSEM S SIXTIETH BIRTHDAY) MIROSLAV BAČÁK AND JONATHAN M. BORWEIN Abstract. We survey and enhance
More informationarxiv: v1 [math.oc] 14 Oct 2014
arxiv:110.3571v1 [math.oc] 1 Oct 01 An Improved Analysis of Semidefinite Approximation Bound for Nonconvex Nonhomogeneous Quadratic Optimization with Ellipsoid Constraints Yong Hsia a, Shu Wang a, Zi Xu
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationSubdifferentiability and the Duality Gap
Subdifferentiability and the Duality Gap Neil E. Gretsky (neg@math.ucr.edu) Department of Mathematics, University of California, Riverside Joseph M. Ostroy (ostroy@econ.ucla.edu) Department of Economics,
More informationOn duality theory of conic linear problems
On duality theory of conic linear problems Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 3332-25, USA e-mail: ashapiro@isye.gatech.edu
More informationTECHNICAL NOTE. A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R"
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: VoL 50, No. 1, JULY 1986 TECHNICAL NOTE A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R" C. M I C H E L O T I Communicated
More informationExact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems
Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation
More informationA globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications Weijun Zhou 28 October 20 Abstract A hybrid HS and PRP type conjugate gradient method for smooth
More informationOn Non-Convex Quadratic Programming with Box Constraints
On Non-Convex Quadratic Programming with Box Constraints Samuel Burer Adam N. Letchford July 2008 Abstract Non-Convex Quadratic Programming with Box Constraints is a fundamental N P-hard global optimisation
More informationSome Contributions to Convex Infinite-Dimensional Optimization Duality
Some Contributions to Convex Infinite-Dimensional Optimization Duality Marco A. López Alicante University King s College London Strand Campus June 2014 Introduction Consider the convex infinite programming
More informationAN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE PROGRAMMING
J Syst Sci Complex (2010) 23: 822 829 AN EQUVALENCY CONDTON OF NONSNGULARTY N NONLNEAR SEMDEFNTE PROGRAMMNG Chengjin L Wenyu SUN Raimundo J. B. de SAMPAO DO: 10.1007/s11424-010-8057-1 Received: 2 February
More informationAN ASYMPTOTIC MINTY S TYPE VARIATIONAL INEQUALITY WITH PSEUDOMONOTONE OPERATORS. G. Isac
Nonlinear Analysis Forum 8(1), pp. 55 64, 2003 AN ASYMPTOTIC MINTY S TYPE VARIATIONAL INEQUALITY WITH PSEUDOMONOTONE OPERATORS G. Isac Department of Mathematics Royal Military College of Canada P.O. Box
More informationConvex analysis on Cartan subspaces
Nonlinear Analysis 42 (2000) 813 820 www.elsevier.nl/locate/na Convex analysis on Cartan subspaces A.S. Lewis ;1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario,
More informationNondifferentiable Higher Order Symmetric Duality under Invexity/Generalized Invexity
Filomat 28:8 (2014), 1661 1674 DOI 10.2298/FIL1408661G Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Nondifferentiable Higher
More informationINVEX FUNCTIONS AND CONSTRAINED LOCAL MINIMA
BULL. AUSRAL. MAH. SOC. VOL. 24 (1981), 357-366. 9C3 INVEX FUNCIONS AND CONSRAINED LOCAL MINIMA B.D. CRAVEN If a certain weakening of convexity holds for the objective and all constraint functions in a
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationA characterization of essentially strictly convex functions on reflexive Banach spaces
A characterization of essentially strictly convex functions on reflexive Banach spaces Michel Volle Département de Mathématiques Université d Avignon et des Pays de Vaucluse 74, rue Louis Pasteur 84029
More information