Scientific Program Cluster Details

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only


Please login, if you want to personalize your selection of clusters.

Cluster: Global optimization

Monday


10:30 - 12:00, room: H 2053

Chair: Jiming Peng and Vikas Singh
Optimization models and methods for computer vision

Kolmogorov Message passing algorithms for MAP-MRF inference [...]
Cremers Convex relaxation techniques with applications in computer vision [...]
Collins Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions [...]

 

13:15 - 14:45, room: H 2053

Chair: Oleg A. Prokopyev
Global optimization: Algorithms and applications

Rebennack Good linear approximations for MINLP Problems with tolerance guarantee [...]
Prokopyev Optimal design of the annual influenza vaccine with autonomous manufacturer [...]
Zhupanska A nonlinear semidefinite programming approach to design of materials [...]

 

15:15 - 16:45, room: H 2053

Chair: Jeff Linderoth
Algorithms and relaxations for nonconvex optimization Problems

Ghaddar A global optimization approach for binary polynomial programs [...]
Kuno A class of convergent subdivision strategies in the conical algorithm for concave minimization [...]
Wechsung Improving relaxations of implicit functions [...]

 

 

Tuesday


10:30 - 12:00, room: H 2053

Chair: Miguel F. Anjos
Convex optimization approaches to polynomial optimization problems

Lambert Convex reformulations of integer quadratically constrained problems [...]
Rendl Active set methods for convex quadratic optimization with simple bounds [...]

 

13:15 - 14:45, room: H 2053

Chair: Arnold Neumaier
Rigorous global optimization

Schichl Balanced rigorous relaxation methods in global optimization [...]
Domes Finding global robust solutions of robust quadratic optimization problems [...]
Neumaier Projective methods for constraint satisfaction and global optimization [...]

 

15:15 - 16:45, room: H 2053

Chair: Leo Liberti
From quadratic through factorable to black-box global optimization

Dumas A new global optimization method based on a sparse grid metamodel [...]
Floudas Globally optimizing mixed-integer quadratically-constrained quadratic programs (MIQCQP) [...]
Tsoukalas Extension of McCormick's composition to multi-variate outer functions [...]

 

 

Wednesday


10:30 - 12:00, room: H 2053

Chair: Zelda Zabinsky
Optimal hybrid control theory approaches to global optimization

Zabinsky Solving non-linear discrete optimization problems via continualization: An interior-point algorithm [...]
Kohn Hybrid dynamic programming for rule constrained multi-objective optimization [...]
Zhang Stochastic control optimization of a binary integer program [...]

 

13:15 - 14:45, room: H 2053

Chair: Sergiy Butenko
Global optimization methods and applications

Pardalos Global optimality conditions in non-convex optimization [...]
Moreno-Centeno Solving combinatorial optimization problems as implicit hitting set problems [...]
Buchanan Maximum clique problem on very large scale sparse networks [...]

 

15:15 - 16:45, room: H 2053

Chair: Evrim Dalkiran
Nonconvex optimization: Theory and algorithms

Dalkiran RLT-POS: Reformulation-linearization technique-based optimization software for polynomial programming problems [...]
Ryoo 0-1 multilinear programming & LAD patterns [...]
Schaber Convergence order of relaxations for global optimization of nonlinear dynamic systems [...]

 

 

Thursday


10:30 - 12:00, room: H 2053

Chair: Pál Burai
Advances in global optimization I

Carrizosa Location on networks. Global optimization problems [...]
Burai Necessary and sufficient condition on global optimality without convexity and second order differentiability [...]

 

13:15 - 14:45, room: H 2053

Chair: Alireza Doagooei
Advances in global optimization II

Orlov On an approach to special nonlinear bilevel problems [...]
Chinneck Better placement of local solver launch points for global optimization [...]
Doagooei Global optimization on the difference of sub-topical functions [...]

 

15:15 - 16:45, room: H 2053

Chair: Duy Van Nguyen
Advances in global optimization III

Csendes Symbolic simplification of nonlinear optimization problems [...]
Nguyen The interior exterior approach for linear programming problem [...]
Nguyen Solving standard problem (StQP) [...]

 

 

Friday


10:30 - 12:00, room: H 0110

Chair: Jiming Peng
Recent advances in nonconvex quadratic programming with random data

Gillis Fast and robust recursive algorithm for separable nonnegative matrix factorization [...]
Peng Quadratic optimization with separable objective and a single quadratic and box constraint [...]
Krokhmal Asymptotic properties of random multidimensional assignment problems [...]

 

13:15 - 14:45, room: H 0110

Chair: Ernesto G. Birgin
Algorithms and applications

Prudente An augmented Lagrangian method with finite termination [...]
Bueno Low order-value approach for solving VaR-constrained optimization problems [...]
Andretta Deterministic and stochastic global optimization techniques for planar covering with elipses problems [...]

 

13:15 - 14:45, room: H 2053

Chair: Zulfiya Ravilevna Gabidullina
Advances in global optimization V

Bigi Beyond canonical DC programs: The single reverse polar problem [...]
Konzett Numerical enclosures of solution manifolds at near singular points [...]
Gabidullina Universal measure of the thickness of separator or pseudo-separator for sets of Euclidean space [...]

 

15:15 - 16:45, room: H 0110

Chair: Oliver Stein
Structural aspects of global optimization

Still Minimization of nonconvex quadratic functions on special feasible sets [...]
Bajbar Nonsmooth versions of Sard's theorem [...]
Dorsch Local models in equilibrium optimization [...]

 

15:15 - 16:45, room: H 2053

Chair: Daniel Aloise
Advances in global optimization VI

Diedam Global optimal control using direct multiple shooting [...]
Aloise A column generation algorithm for semi-supervised clustering [...]
Yamada Global optimization methods utilizing partial separating hyperplanes for a canonical dc programming problem [...]

 

 

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only
  There are three major facts that should be watched out for in all payday loans in the United States. But at the same time, it acts only with sexual arousal. Viagra Online has a number of advantages in comparison with injections in the sexual organ or other procedures aimed at treatment of impotency.