Global Optimization Submissions  2018
February 2018
An algorithm for computing Frechet means on the sphere
Gabriele Eichfelder, Thomas Hotz, Johannes Wieditz
March 2018
A BranchandBound based Algorithm for Nonconvex Multiobjective Optimization
Julia Niebling, Gabriele Eichfelder
Strong Convex Nonlinear Relaxations of the Pooling Problem
James Luedtke, Claudia D'Ambrosio, Jeff Linderoth, Jonas Schweiger
Theory
Discretizationbased algorithms for generalized semiinfinite and bilevel programs with coupling equality constraints
Hatim Djelassi, Moll Glass, Alexander Mitsos
Theory
New SOCP relaxation and branching rule for bipartite bilinear programs
Santanu S. Dey, Asteroide Santana, Yang Wang
April 2018
Rigorous global filtering methods with interval unions
Ferenc Domes, Tiago Montanher, Hermann Schichl, Arnold Neumaier
Rigorous packing of unit squares into a circle
Tiago Montanher, Arnold Neumaier, Mihály Markót
Applications
Tightening McCormick Relaxations Toward Global Solution of the ACOPF Problem
Michael Bynum, Anya Castillo, JeanPaul Watson, Carl Laird
August 2018
A hybrid algorithm for the twotrustregion subproblem
Saeid Ansary Karbasy, Maziar Salahi
Other
Polynomial Optimization on ChebyshevDubiner Webs of Starlike Polygons
Marco Vianello
Other
Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
Federico Piazzon, Marco Vianello
A new dual for quadratic programming and its applications
moslem Zamani
Stochastic Approaches
Efficient global unconstrained black box optimization
Morteza Kimiaei, Arnold Neumaier
September 2018
Applications
DouglasRachford method for the feasibility problem involving a circle and a disc
Suvendu Pattanaik, Sweta Shrivastav
October 2018
Theory
Understanding the Acceleration Phenomenon via HighResolution Differential Equations
Bin Shi, Simon Du, Michael Jordan (Correspondence), Weijie Su (Correspondence)
November 2018
Theory
Deterministic upper bounds in global minimization with nonlinear equality constraints
Christian Füllner, Peter Kirst, Oliver Stein
Feature selection in SVM via polyhedral knorm
Manlio Gaudioso, Enrico Gorgone, Jean Baptiste HiriartUrruty
On local nonglobal minimizers of quadratic optimization problem with a single quadratic constraint
Akram Taati, Maziar Salahi
Selecting cutting planes for quadratic semidefinite outerapproximation via trained neural networks
Radu BalteanLugojan, Pierre Bonami, Ruth Misener, Andrea Tramontani
Packing Ovals In Optimized Regular Polygons
F.J. Kampas, J.D. Pintér, I. Castillo
Applications
Largest Small nPolygons: Numerical Results and Optimum Estimates
Janos Pinter
December 2018
Intersection cuts for factorable MINLP
Felipe Serrano
Theory
The convex hull of a quadratic constraint over a polytope
Asteroide Santana, Santanu Dey
