AdvOL Student Seminars and Defences
Joe Guan, January 23, 2018, 15:30-16:00, ITB 201
Speaker:   Joe Guan

Title:  Geometric Aspects of Combinatorial Optimization
 
AdvOL Optimization Seminars
Antoine Deza, January 23, 2018, 16:30-17:30, ITB 201
Speaker:   Antoine Deza
Department of Computing and Software
McMaster University

Title:  On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs
Read more...
 
Fields Institute Industrial Optimization Seminar, January 16, 2018
Speakers:   Paul Ayers (McMaster University)
Jeffrey Kelly (Industrial Algorithms)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Kamil A. Khan, April 4, 2017, 16:30-17:30, ITB 201
Friday, 23 February 2018
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % Educational
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5342597
Kamil A. Khan, April 4, 2017, 16:30-17:30, ITB 201
Speaker:   Kamil A. Khan
Department of Chemical Engineering
McMaster University

Title:  Generating convex underestimators for use in global optimization

Several applications in engineering, physics, and economics involve nonconvex optimization problems that must be solved to guaranteed global optimality. Methods for deterministic continuous nonconvex minimization typically proceed by computing progressively tighter upper and lower bounds on the unknown optimal solution value. While upper bounds may be obtained by applying local solvers, lower bounds are less straightforward to compute, and fundamentally require global knowledge of the considered system. Convex underestimators of the functions involved may be used to provide this knowledge, since any local minimum of a convex underestimator yields a guaranteed lower bound for the original problem. However, generating useful underestimators for nontrivial functions is itself a nontrivial task, as even compositions of convex functions are not necessarily convex. This presentation describes a pioneering approach by McCormick (1976) for generating useful convex underestimators for composite functions automatically, and details several recent improvements and generalizations of this approach. Implications and examples are discussed.
 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!