A Test Set of Semi-Infinite Programs
|
|
- Vivien Mathews
- 6 years ago
- Views:
Transcription
1 A Test Set of Semi-Infinite Programs Alexander Mitsos, revised by Hatim Djelassi Process Systems Engineering (AVT.SVT), RWTH Aachen University, Aachen, Germany February 26, 2016 (first published August 26, 2009) Keywords SIP ; NLP ; Slater point ; nonconvex ; global optimization 1 Test Set Test problems for semi-infinite programs (SIPs) without convexity assumptions are presented 1.1 Problems based on Watson [9] For consistency purposes the problem labels of Watson [9] are used. X = [ 1000, 1000] 2 f(x) = x 2 1/3 + x x 1 /2 g(x, y) = (1 x 2 1 y 2 ) 2 x 1 y 2 x x 2. (2) Financial support from the Deutsche Forschungsgemeinschaft (German Research Association) through grant GSC 111 is gratefully acknowledged. amitsos@alum.mit.edu hatim.djelassi@avt.rwth-aachen.de.
2 X = [ 1000, 1000] 3 f(x) = exp(x 1 ) + exp(x 2 ) + exp(x 3 ) g(x, y) = 1/(1 + y 2 ) x 1 x 2 y x 3 y 2. (5) X = [ 1000, 1000] 2 f(x) = (x 1 2 x x 2 2 x 2 2 x 2 13) 2 + (x 1 14x 2 + x x ) 2 g(x, y) = x x 2 y 2 + exp(x 1 + x 2 ) exp(y). (6) Note that in [1] the exponent is missing in the first term of the objective function. X = [ 1000, 1000] 3 2 f(x) = x x x 2 3 g(x, y) = x 1 (y 1 + y ) + x 2 (y 1 y 2 y2) 2 + x 3 (y 1 y 2 + y2 2 + y 2 ) + 1. (7) X = [ 1000, 1000] 6 2 f(x) = x 1 + x 2 /2 + x 3 /2 + x 4 /3 + x 5 /4 + x 6 /3. g(x, y) = exp(y1 2 + y2) 2 x 1 x 2 y 1 x 3 y 2 x 4 y1 2 x 5 y 1 y 2 x 6 y2. 2 (8) Note that presumably in Watson s collection [9] the coefficient of x 4 in the objective function is mistyped. This is suggested by the optimal solution value reported in [9] and by the symmetry of the problem with respect to the variables x 4 and x 6.
3 X = [ 1000, 1000] 6 Y = [ 1, 1] 2 f(x) = 4 x 1 2/3 (x 4 + x 6 ) g(x, y) = x 1 + x 2 y 1 + x 3 y 2 + x 4 y1 2 + x 5 y 1 y 2 + x 6 y2 2 3 (y1 2 y2) 2 2. (9) Note that the last term was rewritten from (y 1 y 2 ) 2 (y 1 + y 2 ) 2 since bilinear products result in weak relaxations, and higher CPU requirements for the solution of the NLPs. X = [0, 1] [ 1000, 1000] Y = [ 1, 1] f(x) = x 2 g(x, y) = (x 1 y) 2 x 2. (H) This problem was first proposed without bounds on x 2 as Example 4.1 in [7]. The bounds were subsequently added in [2]. X = [ 1000, 1000] 2 Y = [ 1, 1] f(x) = x 2 g(x, y) = 2 x 2 1 y 2 y 4 + x 2 1 x 2. (N) 1.2 New Continuous Problems The following two problems are based on problem 4 by Watson [9]
4 1. X = [ 1000, 1000] 3 f(x) = x 1 + x 2 /2. + x 3 /3. g(x, y) = exp(y 1) x 1 x 2 y x 3 y 2. (4 3) 2. X = [ 1000, 1000] 6 f(x) = x 1 + x 2 /2. + x 3 /3 + x 4 /4 + x 5 /5 + x 6 /6. g(x, y) = exp(y 1) x 1 x 2 y x 3 y 2 x 4 y 3 x 5 y 4 x 6 y 5. (4 6) The following problem is based on the Shekel Function in [5] 1. X = [ 1000, 1000] 2 Y = [ 10, 10] 1 f(x) = (x 1 4) 2 + (x 2 4) (x 1 1) 2 + (x 2 1) (x 1 8) 2 + (x 2 8) g(x, y) = 0.1 (x 1 y) 2 (x 2 y) 2. (S) The following problem is aimed at provoking a dense discretization in methods similar to [3]. 1. X = [0, 6] Y = [2, 6] f(x) = 10 x g(x, y) = y 2 + x y 2. (DP) 1 + exp( 40(x y)) 1.3 New Problems Involving Integer Variables The following examples involve also discrete variables
5 1. Z = {0, 1} 3 3 f(x) = z 1 + 2z 2 /2. 3z 3 /3 (IP1) g(x, z, y) = z 1 y 2 1 y z 2 (y 2 y 1 y 3 ) + z 3 (exp(y 3 ) 3). 2. X = [ 1000, 1000] 2 Z = {0, 1} 3 f(x) = x exp(x 2 ) + z 1 x z 2 x 1 x 2 3 z 3 (MINLP1) g(x, z, y) = x 1 exp(y 1 ) + x 2 (y 1 y 2 2) + z 1 (y 2 1 y 2 2) + z 2 (y 2 y 1 y 3 ) + z 3 (exp(y 3 ) 3). 3. X = [ 10, 10] 2 Z = {0, 1} 3 f(x) = x exp(x 2 ) + z 1 x z 2 x 1 x z 3 (MINLP2.) g(x, z, y) = x 1 exp(y 1 ) + x 2 (y 1 y 2 2) + z 1 (y 2 1 y 2 2) + z 2 (y 2 y 1 y 3 ) + z 3 (exp(y 3 ) 3). 1.4 Design Centering The goal of design centering is to place a body B(x) into a container C. Typically, some metric of the body, e.g., volume, or area, is maximized. The constraint B(x) C, leads in general to a GSIP, but in some cases an equivalent SIP can be formulated. The following problems are based on the design centering problem by Floudas and Stein [6, Section 5.2] with C R 2 after some modifications to avoid the trigonometric functions used therein, which are not currently supported by BARON [8]. The body is a disk, parameterized by the midpoint (x 1, x 2 ) and the radius x 3, i.e., B(x) = {z R 2 : (z 1 x 1 ) 2 + (z 2 x 2 ) 2 x 2 3}. The container is described by two inequality constraints.
6 Since C is simply connected, Floudas and Stein [6] use B(x) C, or equivalently the constraints c i (z) 0, z B(x), i {1, 2}. However, the parameterization of B(x) leads to trigonometric functions. Here, the following formulation is used instead: c i (x 1, x 2 ) 0, i {1, 2} (y x 1 ) 2 + (w i (y) x 2 ) 2 x 2 3, y Y, i {1, 2} where Y R is a large enough set and the intermediate w i (y) is calculated by c i (y, w i ) = 0. Obviously, this calculation is not possible for any function c i, but it is for the functions of interest herein. The first constraint ensures that the center of the circle is within the container. The second constraint mandates that the boundary of the container is sufficiently far away from the center of the disk, or equivalently the radius is sufficiently small. The container C used by Floudas and Stein is described by two functions, c l (y) = 0.3 sin(π y 1 ) y 2 (for the lower side) and c u = y y2 2 1 (for the upper side). The former contains a trigonometric function, and therefore is replaced by (the simpler) x 2 x 3. For the latter setting c 2 = 0 directly gives y 2 = (1 y1 2)/0.3. min x 3 x s.t. x 2 (1 x 2 1 )/0.3 0 x 2 3 (y x 1 ) 2 (1 y2 )/0.3 x 2 ) 2 0, y [ 1, 1] x 2 + x 3 0 x [ 1, 1] [0, 2] [0, 1]. (D1 0 1) Note the presence of regular constraints. Note also that 1 t 2 is not differentiable at t = ±1 (the boundaries of X and Y ). Arguably, Problem (D1 0 1) is significantly simpler than the original problem by Floudas and Stein. Therefore, a second design centering problem is formulated with c 2 (z) = 0.25 (z 1 0.5) 2 z 2. The
7 resulting design problem is min x 3 x s.t. x 2 (1 x 2 1 )/0.3 0 x 2 3 (y x 1 ) 2 (1 y2 )/0.3 x 2 ) 2 0, y [ 1, 1] 0.25 (x 1 0.5) 2 x 2 0 x 2 3 (y x 1 ) 2 ( 0.25 (y 0.5) 2 x 2 ) 2 0, y [ 1, 1] x [ 1, 1] [0, 2] [0, 1]. (D2 0 1) Note the presence of multiple semi-infinite constraints and regular constraints. Note also that 0.25 (t 0.5) 2 is not differentiable at t = 0 (in the interior of X or Y ). To solve problems involving in GAMS [4] the keyword DNLP must be used instead of NLP. Design problems with two discs are considered, resulting in twice as many variables and parameters. Additionally it must be ensured that the discs don t overlap which results into the constraint (x 4 x 1 ) 2 + (x 5 x 4 ) 2 (x 3 + x 6 ) 2 An obvious strategy for upper bounding is to use the solution with one disc as an initial guess. However, this is not exploited here.
8 min x 3 x 6 x s.t. x 2 (1 x 2 1 )/ x 2 3 (y 1 x 1 ) 2 (1 y1 2) 2)/0.3 x 0, y 1 [ 1, 1] x 2 6 (y 2 x 4 ) 2 x 3 x 2 x 5 (1 x 2 4 )/ (1 y2 5) 2)/0.3 x 0, y 2 [ 1, 1] x 6 x 5 (x 4 x 1 ) 2 + (x 5 x 4 ) 2 (x 3 + x 6 ) 2 x 3 x 6 x 3 + x x [ 1, 1] [0, 2] [0, 1] [ 1, 1] [0, 2] [0, 1]. (D1 0 2)
9 min x 3 x 6 x s.t. x 2 (1 x 2 1 )/ x 2 3 (y 1 x 1 ) 2 (1 y1 2) 2)/0.3 x 0, y 1 [ 1, 1] 0.25 (x 1 0.5) 2 x 2 0 x 2 3 (y 1 x 1 ) 2 ( 0.25 (y 1 0.5) 2 ) 2 x 2 0, y1 [ 1, 1] x 5 (1 x 2 4 )/ x 2 6 (y 2 x 4 ) 2 (1 y2 5) 2)/0.3 x 0, y 2 [ 1, 1] 0.25 (x 4 0.5) 2 x 5 0 x 2 6 (y 2 x 4 ) 2 ( 0.25 (y 2 0.5) 2 x 5 ) 2 0, y2 [ 1, 1] (x 4 x 1 ) 2 + (x 5 x 2 ) 2 (x 3 + x 6 ) 2 x 3 x 6 x 3 + x 6 1 x [ 1, 1] [0, 2] [0, 1] [ 1, 1] [0, 2] [0, 1]. (D2 0 2) Finally, another variant of the design problems is considered where the sum of the areas of the discs is maximized. For the case of one disc the problems are mathematically equivalent, but the new objective is nonconvex and therefore potentially numerically more challenging. As expected the algorithm gives very similar results for the two different objective functions. On the other hand, for the case of two discs the objectives are different; the maximal area results in a slightly bigger difference between the radii of the two discs. min x x 2 3 Constraints same as (D1 0 1) (D1 1 1) min x x 2 3 Constraints same as (D2 0 1) (D2 1 1)
10 min x x 2 3 x 2 6 Constraints same as (D1 0 2) (D1 1 2) min x x 2 3 x 2 6 Constraints same as (D2 0 2) (D2 1 2) References [1] B. Bhattacharjee, W. H. Green Jr., and P. I. Barton. Interval methods for semi-infinite programs. Computational Optimization and Applications, 30(1):63 93, [2] B. Bhattacharjee, P. Lemonidis, W. H. Green Jr., and P. I. Barton. Global solution of semi-infinite programs. Mathematical Programming, Series B, 103(2): , [3] J. W. Blankenship and J. E. Falk. Infinitely constrained optimization problems. Journal of Optimization Theory and Applications, 19(2): , [4] A. Brooke, D. Kendrick, and A. Meeraus. GAMS: A User s Guide. The Scientific Press, Redwood City, California, [5] C. A. Floudas, P. M. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gümüs, S. T. Harding, J. L. Klepeis, C. A. Meyer, and C. A. Schweiger. Handbook of Test Problems in Local and Global Optimization. Nonconvex Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht, [6] C. A. Floudas and O. Stein. The adaptive convexification algorithm: A feasible point method for semiinfinite programming. SIAM Journal on Optimization, 18(4): , [7] R. Hettich and K. O. Kortanek. Semi-infinite programming - Theory, methods, and applications. SIAM Review, 35(3): , [8] N. V. Sahinidis. BARON: A general purpose global optimization software package. Journal of Global Optimization, 8: , [9] G. Watson. Numerical experiments with globally convergent methods for semi-infinite programming problems. Lecture Notes in Economics and Mathematical Systems, 215: , 1983.
Exact Computation of Global Minima of a Nonconvex Portfolio Optimization Problem
Frontiers In Global Optimization, pp. 1-2 C. A. Floudas and P. M. Pardalos, Editors c 2003 Kluwer Academic Publishers Exact Computation of Global Minima of a Nonconvex Portfolio Optimization Problem Josef
More informationGlobal optimization on Stiefel manifolds some particular problem instances
6 th International Conference on Applied Informatics Eger, Hungary, January 27 31, 2004. Global optimization on Stiefel manifolds some particular problem instances János Balogh Department of Computer Science,
More informationConvex Quadratic Relaxations of Nonconvex Quadratically Constrained Quadratic Progams
Convex Quadratic Relaxations of Nonconvex Quadratically Constrained Quadratic Progams John E. Mitchell, Jong-Shi Pang, and Bin Yu Original: June 10, 2011 Abstract Nonconvex quadratic constraints can be
More informationGLOBAL OPTIMIZATION WITH GAMS/BARON
GLOBAL OPTIMIZATION WITH GAMS/BARON Nick Sahinidis Chemical and Biomolecular Engineering University of Illinois at Urbana Mohit Tawarmalani Krannert School of Management Purdue University MIXED-INTEGER
More informationImplementation of an αbb-type underestimator in the SGO-algorithm
Implementation of an αbb-type underestimator in the SGO-algorithm Process Design & Systems Engineering November 3, 2010 Refining without branching Could the αbb underestimator be used without an explicit
More informationMixed-Integer Nonlinear Programming
Mixed-Integer Nonlinear Programming Claudia D Ambrosio CNRS researcher LIX, École Polytechnique, France pictures taken from slides by Leo Liberti MPRO PMA 2016-2017 Motivating Applications Nonlinear Knapsack
More informationSolving generalized semi-infinite programs by reduction to simpler problems.
Solving generalized semi-infinite programs by reduction to simpler problems. G. Still, University of Twente January 20, 2004 Abstract. The paper intends to give a unifying treatment of different approaches
More informationMcCormick Relaxations: Convergence Rate and Extension to Multivariate Outer Function
Introduction Relaxations Rate Multivariate Relaxations Conclusions McCormick Relaxations: Convergence Rate and Extension to Multivariate Outer Function Alexander Mitsos Systemverfahrenstecnik Aachener
More informationIssues in the Development of Global Optimization Algorithms for Bilevel Programs with a Nonconvex Inner Program
Issues in the Development of Global Optimiation Algorithms for Bilevel Programs with a Nonconvex Inner Program Alexander Mitsos and Paul I. Barton* Department of Chemical Engineering Massachusetts Institute
More informationMachine learning, ALAMO, and constrained regression
Machine learning, ALAMO, and constrained regression Nick Sahinidis Acknowledgments: Alison Cozad, David Miller, Zach Wilson MACHINE LEARNING PROBLEM Build a model of output variables as a function of input
More informationA Computational Comparison of Branch and Bound and. Outer Approximation Algorithms for 0-1 Mixed Integer. Brian Borchers. John E.
A Computational Comparison of Branch and Bound and Outer Approximation Algorithms for 0-1 Mixed Integer Nonlinear Programs Brian Borchers Mathematics Department, New Mexico Tech, Socorro, NM 87801, U.S.A.
More informationDeterministic Global Optimization Algorithm and Nonlinear Dynamics
Deterministic Global Optimization Algorithm and Nonlinear Dynamics C. S. Adjiman and I. Papamichail Centre for Process Systems Engineering Department of Chemical Engineering and Chemical Technology Imperial
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 informationHow to Solve a Semi-infinite Optimization Problem
How to Solve a Semi-infinite Optimization Problem Oliver Stein March 27, 2012 Abstract After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory
More informationappeared in: S. Dempe, V. Kalashnikov (eds): Optimization with Multivalued Mappings, Springer, 2006,
appeared in: S. Dempe, V. Kalashnikov (eds): Optimization with Multivalued Mappings, Springer, 2006, 209-228. Chapter 1 A SEMI-INFINITE APPROACH TO DESIGN CENTERING Oliver Stein RWTH Aachen University
More informationLecture 4: Optimization. Maximizing a function of a single variable
Lecture 4: Optimization Maximizing or Minimizing a Function of a Single Variable Maximizing or Minimizing a Function of Many Variables Constrained Optimization Maximizing a function of a single variable
More informationSolving Mixed-Integer Nonlinear Programs
Solving Mixed-Integer Nonlinear Programs (with SCIP) Ambros M. Gleixner Zuse Institute Berlin MATHEON Berlin Mathematical School 5th Porto Meeting on Mathematics for Industry, April 10 11, 2014, Porto
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 informationHeuristics and Upper Bounds for a Pooling Problem with Cubic Constraints
Heuristics and Upper Bounds for a Pooling Problem with Cubic Constraints Matthew J. Real, Shabbir Ahmed, Helder Inàcio and Kevin Norwood School of Chemical & Biomolecular Engineering 311 Ferst Drive, N.W.
More information(x x 0 ) 2 + (y y 0 ) 2 = ε 2, (2.11)
2.2 Limits and continuity In order to introduce the concepts of limit and continuity for functions of more than one variable we need first to generalise the concept of neighbourhood of a point from R to
More informationA Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization
A Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization Sven Leyffer 2 Annick Sartenaer 1 Emilie Wanufelle 1 1 University of Namur, Belgium 2 Argonne National Laboratory, USA IMA Workshop,
More informationNumerical Optimization. Review: Unconstrained Optimization
Numerical Optimization Finding the best feasible solution Edward P. Gatzke Department of Chemical Engineering University of South Carolina Ed Gatzke (USC CHE ) Numerical Optimization ECHE 589, Spring 2011
More informationValid Inequalities and Convex Hulls for Multilinear Functions
Electronic Notes in Discrete Mathematics 36 (2010) 805 812 www.elsevier.com/locate/endm Valid Inequalities and Convex Hulls for Multilinear Functions Pietro Belotti Department of Industrial and Systems
More informationICRS-Filter: A Randomized Direct Search Algorithm for. Constrained Nonconvex Optimization Problems
ICRS-Filter: A Randomized Direct Search Algorithm for Constrained Nonconvex Optimization Problems Biyu Li 1, Viet H. Nguyen 1, Chieh. L. Ng 1, E. A. del Rio-Chanona 1 Vassilios S. Vassiliadis 1, Harvey
More informationAn approach to constrained global optimization based on exact penalty functions
DOI 10.1007/s10898-010-9582-0 An approach to constrained global optimization based on exact penalty functions G. Di Pillo S. Lucidi F. Rinaldi Received: 22 June 2010 / Accepted: 29 June 2010 Springer Science+Business
More informationMixed Integer Non Linear Programming
Mixed Integer Non Linear Programming Claudia D Ambrosio CNRS Research Scientist CNRS & LIX, École Polytechnique MPRO PMA 2016-2017 Outline What is a MINLP? Dealing with nonconvexities Global Optimization
More informationStructural Multiplicity and Redundancy in Chemical Process Synthesis with MINLP
Structural Multiplicity and Redundancy in Chemical Process Synthesis with MINLP Tivadar Farkas, Endre Rev and Zoltan Lelkes * Chemical Engineering Department, Budapest University of Technology and Economics
More informationComputer Sciences Department
Computer Sciences Department Valid Inequalities for the Pooling Problem with Binary Variables Claudia D Ambrosio Jeff Linderoth James Luedtke Technical Report #682 November 200 Valid Inequalities for the
More informationA Decomposition-based MINLP Solution Method Using Piecewise Linear Relaxations
A Decomposition-based MINLP Solution Method Using Piecewise Linear Relaxations Pradeep K. Polisetty and Edward P. Gatzke 1 Department of Chemical Engineering University of South Carolina Columbia, SC 29208
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 informationImproved Big-M Reformulation for Generalized Disjunctive Programs
Improved Big-M Reformulation for Generalized Disjunctive Programs Francisco Trespalacios and Ignacio E. Grossmann Department of Chemical Engineering Carnegie Mellon University, Pittsburgh, PA 15213 Author
More informationStochastic geometric optimization with joint probabilistic constraints
Stochastic geometric optimization with joint probabilistic constraints Jia Liu a,b, Abdel Lisser 1a, Zhiping Chen b a Laboratoire de Recherche en Informatique (LRI), Université Paris Sud - XI, Bât. 650,
More informationA semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint
Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationExercises * on Linear Algebra
Exercises * on Linear Algebra Laurenz Wiskott Institut für Neuroinformatik Ruhr-Universität Bochum, Germany, EU 4 February 7 Contents Vector spaces 4. Definition...............................................
More informationMINLP optimization of the single-storey industrial building steel structure
High Performance Structures and Materials III 643 MINLP optimization of the single-storey industrial building steel structure T. Žula, U. Klanšek & S. Kravanja University of Maribor, Faculty of Civil Engineering,
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationLCPI method to find optimal solutions of nonlinear programming problems
ISSN 1 746-7233, Engl, UK World Journal of Modelling Simulation Vol. 14 2018) No. 1, pp. 50-57 LCPI method to find optimal solutions of nonlinear programming problems M.H. Noori Skari, M. Ghaznavi * Faculty
More informationFirst-Order Optimally Conditions in Generalized Semi-Infinite Programming 1
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 101, No. 3, pp. 677-691, JUNE 1999 First-Order Optimally Conditions in Generalized Semi-Infinite Programming 1 J. J. RUCKMANN 2 AND A. SHAPIRO 3 Communicated
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationMS&E 318 (CME 338) Large-Scale Numerical Optimization
Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 2017 Notes 10: MINOS Part 1: the Reduced-Gradient
More informationGlobal Optimization of Non-convex Generalized Disjunctive Programs: A Review on Relaxations and Solution Methods
Noname manuscript No. (will be inserted by the editor) Global Optimization of Non-convex Generalized Disjunctive Programs: A Review on Relaxations and Solution Methods Juan P. Ruiz Ignacio E. Grossmann
More informationIntroduction to Real Analysis
Introduction to Real Analysis Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Sets Sets are the basic objects of mathematics. In fact, they are so basic that
More informationChecking Monotonicity is NP-Hard Even for Cubic Polynomials
Checking Monotonicity is NP-Hard Even for Cubic Polynomials Andrzej Pownuk 1, Luc Longpré 2, and Vladik Kreinovich 2 Departments of 1 Mathematical Sciences and 2 Computer Science, University of Texas at
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationOptimization: an Overview
Optimization: an Overview Moritz Diehl University of Freiburg and University of Leuven (some slide material was provided by W. Bangerth and K. Mombaur) Overview of presentation Optimization: basic definitions
More informationSome Recent Advances in Mixed-Integer Nonlinear Programming
Some Recent Advances in Mixed-Integer Nonlinear Programming Andreas Wächter IBM T.J. Watson Research Center Yorktown Heights, New York andreasw@us.ibm.com SIAM Conference on Optimization 2008 Boston, MA
More informationTest 2 Review Math 1111 College Algebra
Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationExact Penalty Functions for Nonlinear Integer Programming Problems
Exact Penalty Functions for Nonlinear Integer Programming Problems S. Lucidi, F. Rinaldi Dipartimento di Informatica e Sistemistica Sapienza Università di Roma Via Ariosto, 25-00185 Roma - Italy e-mail:
More informationGlobal Optimization by Interval Analysis
Global Optimization by Interval Analysis Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationLecture 1. Stochastic Optimization: Introduction. January 8, 2018
Lecture 1 Stochastic Optimization: Introduction January 8, 2018 Optimization Concerned with mininmization/maximization of mathematical functions Often subject to constraints Euler (1707-1783): Nothing
More informationA video College Algebra course & 6 Enrichment videos
A video College Algebra course & 6 Enrichment videos Recorded at the University of Missouri Kansas City in 1998. All times are approximate. About 43 hours total. Available on YouTube at http://www.youtube.com/user/umkc
More informationUMUC MATH-107 Final Exam Information
UMUC MATH-07 Final Exam Information What should you know for the final exam? Here are some highlights of textbook material you should study in preparation for the final exam. Review this material from
More informationSoftware for Integer and Nonlinear Optimization
Software for Integer and Nonlinear Optimization Sven Leyffer, leyffer@mcs.anl.gov Mathematics & Computer Science Division Argonne National Laboratory Roger Fletcher & Jeff Linderoth Advanced Methods and
More informationThe Dual of the Maximum Likelihood Method
Open Journal of Statistics, 06, 6, 86-93 Published Online February 06 in SciRes. http://www.scirp.org/journal/ojs http://dx.doi.org/0.436/ojs.06.606 The Dual of the Maximum Likelihood Method Quirino Paris
More informationFakultät für Mathematik und Informatik
Fakultät für Mathematik und Informatik Preprint 2017-03 S. Dempe, F. Mefo Kue Discrete bilevel and semidefinite programg problems ISSN 1433-9307 S. Dempe, F. Mefo Kue Discrete bilevel and semidefinite
More informationAn Active Set Strategy for Solving Optimization Problems with up to 200,000,000 Nonlinear Constraints
An Active Set Strategy for Solving Optimization Problems with up to 200,000,000 Nonlinear Constraints Klaus Schittkowski Department of Computer Science, University of Bayreuth 95440 Bayreuth, Germany e-mail:
More informationResearch Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
Mathematical Problems in Engineering Volume 2010, Article ID 346965, 12 pages doi:10.1155/2010/346965 Research Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More informationModule 2: Reflecting on One s Problems
MATH55 Module : Reflecting on One s Problems Main Math concepts: Translations, Reflections, Graphs of Equations, Symmetry Auxiliary ideas: Working with quadratics, Mobius maps, Calculus, Inverses I. Transformations
More informationOn a Polynomial Fractional Formulation for Independence Number of a Graph
On a Polynomial Fractional Formulation for Independence Number of a Graph Balabhaskar Balasundaram and Sergiy Butenko Department of Industrial Engineering, Texas A&M University, College Station, Texas
More informationPositive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix
Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix Milan Hladík Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics, Malostranské
More informationSolving Global Optimization Problems by Interval Computation
Solving Global Optimization Problems by Interval Computation Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationCollege Prep Algebra III Course #340. Course of Study. Findlay City School
College Prep Algebra III Course #340 Course of Study Findlay City School Algebra III Table of Contents 1. Findlay City Schools Mission Statement and Beliefs 2. Algebra III Curriculum Map 3. Algebra III
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More informationA global optimization method, αbb, for general twice-differentiable constrained NLPs I. Theoretical advances
Computers Chem. Engng Vol. 22, No. 9, pp. 1137 1158, 1998 Copyright 1998 Elsevier Science Ltd All rights reserved. Printed in Great Britain PII: S0098-1354(98)00027-1 0098 1354/98 $19.00#0.00 A global
More informationSolving a Class of Generalized Nash Equilibrium Problems
Journal of Mathematical Research with Applications May, 2013, Vol. 33, No. 3, pp. 372 378 DOI:10.3770/j.issn:2095-2651.2013.03.013 Http://jmre.dlut.edu.cn Solving a Class of Generalized Nash Equilibrium
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 informationTopology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7
Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Question 1: The goal of this exercise is to give some equivalent characterizations for the interior of a set. Let X be a topological
More informationFourth Week: Lectures 10-12
Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore
More informationRevision Topic 8: Solving Inequalities Inequalities that describe a set of integers or range of values
Revision Topic 8: Solving Inequalities Inequalities that describe a set of integers or range of values The inequality signs: > greater than < less than greater than or equal to less than or equal to can
More informationApplications and algorithms for mixed integer nonlinear programming
Applications and algorithms for mixed integer nonlinear programming Sven Leyffer 1, Jeff Linderoth 2, James Luedtke 2, Andrew Miller 3, Todd Munson 1 1 Mathematics and Computer Science Division, Argonne
More informationHeuristics for nonconvex MINLP
Heuristics for nonconvex MINLP Pietro Belotti, Timo Berthold FICO, Xpress Optimization Team, Birmingham, UK pietrobelotti@fico.com 18th Combinatorial Optimization Workshop, Aussois, 9 Jan 2014 ======This
More informationMixed Integer Nonlinear Programs Theory, Algorithms & Applications
Mixed Integer Nonlinear Programs Theory, Algorithms & Applications Mohit Tawarmalani tawarmal@uiuc.edu Department of Mechanical and Industrial Engineering Nick Sahinidis nikos@uiuc.edu Department of Chemical
More informationFIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow
FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1 Tim Hoheisel and Christian Kanzow Dedicated to Jiří Outrata on the occasion of his 60th birthday Preprint
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationSOLUTIONS AND OPTIMALITY CRITERIA TO BOX CONSTRAINED NONCONVEX MINIMIZATION PROBLEMS. David Yang Gao. (Communicated by K.L. Teo)
JOURNAL OF INDUSTRIAL AND Website: http://aimsciences.org MANAGEMENT OPTIMIZATION Volume 3, Number 2, May 2007 pp. 293 304 SOLUTIONS AND OPTIMALITY CRITERIA TO BOX CONSTRAINED NONCONVEX MINIMIZATION PROBLEMS
More informationM361 Theory of functions of a complex variable
M361 Theory of functions of a complex variable T. Perutz U.T. Austin, Fall 2012 Lecture 4: Exponentials and logarithms We have already been making free use of the sine and cosine functions, cos: R R, sin:
More information1 Introduction A large proportion of all optimization problems arising in an industrial or scientic context are characterized by the presence of nonco
A Global Optimization Method, BB, for General Twice-Dierentiable Constrained NLPs I. Theoretical Advances C.S. Adjiman, S. Dallwig 1, C.A. Floudas 2 and A. Neumaier 1 Department of Chemical Engineering,
More informationResearch Article Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization
Mathematical Problems in Engineering Volume 2010, Article ID 602831, 11 pages doi:10.1155/2010/602831 Research Article Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization
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 informationOptimality conditions for unconstrained optimization. Outline
Optimality conditions for unconstrained optimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University September 13, 2018 Outline 1 The problem and definitions
More informationOptimal Preconditioners for Interval Gauss Seidel Methods
Optimal Preconditioners for Interval Gauss Seidel Methods R B Kearfott and Xiaofa Shi Introduction Consider the following nonlinear system f 1 x 1, x 2,, x n ) F X) f n x 1, x 2,, x n ) where bounds x
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 informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationOn the composition of convex envelopes for quadrilinear terms
Author manuscript, published in "Optimization, Simulation, and Control (2013) pp 1-16" DOI : 10.1007/978-1-4614-5131-0_1 On the composition of convex envelopes for quadrilinear terms Pietro Belotti, Sonia
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationConvex envelopes, cardinality constrained optimization and LASSO. An application in supervised learning: support vector machines (SVMs)
ORF 523 Lecture 8 Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Any typos should be emailed to a a a@princeton.edu. 1 Outline Convexity-preserving operations Convex envelopes, cardinality
More informationFormulas to remember
Complex numbers Let z = x + iy be a complex number The conjugate z = x iy Formulas to remember The real part Re(z) = x = z+z The imaginary part Im(z) = y = z z i The norm z = zz = x + y The reciprocal
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More information1. The sides of a triangle are in the ratio 3 : 5 : 9. Which of the following words best describes the triangle?
UNIVERSITY OF NORTH CAROLINA CHARLOTTE 999 HIGH SCHOOL MATHEMATICS CONTEST March 8, 999 The sides of a triangle are in the ratio : 5 : 9 Which of the following words best describes the triangle? (A) obtuse
More informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
More informationNew Class of duality models in discrete minmax fractional programming based on second-order univexities
STATISTICS, OPTIMIZATION AND INFORMATION COMPUTING Stat., Optim. Inf. Comput., Vol. 5, September 017, pp 6 77. Published online in International Academic Press www.iapress.org) New Class of duality models
More information2017 Michigan Mathematics Prize Competition Solutions
017 Michigan Mathematics Prize Competition Solutions 1. Consider a normal 8 8 chessboard, where each square is labelled with either 1 or 1. Let a k be the product of the numbers in the kth row, and let
More informationN. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:
0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything
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 informationMINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms
MINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms Jeff Linderoth Industrial and Systems Engineering University of Wisconsin-Madison Jonas Schweiger Friedrich-Alexander-Universität
More informationLecture 4 September 15
IFT 6269: Probabilistic Graphical Models Fall 2017 Lecture 4 September 15 Lecturer: Simon Lacoste-Julien Scribe: Philippe Brouillard & Tristan Deleu 4.1 Maximum Likelihood principle Given a parametric
More information