Optimization Online


Global Optimization Submissions - 2018

February 2018

An algorithm for computing Frechet means on the sphere
Gabriele Eichfelder, Thomas Hotz, Johannes Wieditz

March 2018

A Branch-and-Bound 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

Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
Hatim Djelassi, Moll Glass, Alexander Mitsos

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

Tightening McCormick Relaxations Toward Global Solution of the ACOPF Problem
Michael Bynum, Anya Castillo, Jean-Paul Watson, Carl Laird

August 2018

A hybrid algorithm for the two-trust-region subproblem
Saeid Ansary Karbasy, Maziar Salahi

Polynomial Optimization on Chebyshev-Dubiner Webs of Starlike Polygons
Marco Vianello

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

Douglas-Rachford method for the feasibility problem involving a circle and a disc
Suvendu Pattanaik, Sweta Shrivastav

October 2018

Understanding the Acceleration Phenomenon via High-Resolution Differential Equations
Bin Shi, Simon Du, Michael Jordan (Correspondence), Weijie Su (Correspondence)

November 2018

Deterministic upper bounds in global minimization with nonlinear equality constraints
Christian Füllner, Peter Kirst, Oliver Stein

Feature selection in SVM via polyhedral k-norm
Manlio Gaudioso, Enrico Gorgone, Jean Baptiste Hiriart-Urruty

On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
Akram Taati, Maziar Salahi

Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks
Radu Baltean-Lugojan, Pierre Bonami, Ruth Misener, Andrea Tramontani

Packing Ovals In Optimized Regular Polygons
F.J. Kampas, J.D. Pintér, I. Castillo

Largest Small n-Polygons: Numerical Results and Optimum Estimates
Janos Pinter

December 2018

Intersection cuts for factorable MINLP
Felipe Serrano

The convex hull of a quadratic constraint over a polytope
Asteroide Santana, Santanu Dey

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society