On function monotonicity in simplicial branch and bound

E.M.T. Hendrix, J.M.G. Salmerón, L.G. Casado

Research output: Contribution to conferenceConference paperAcademicpeer-review

Abstract

Branch and bound methods in Global Optimization guarantee to find the set of global minimum points up to a certain accuracy. Partition sets typically take the shape of boxes, cones and simplices. In the tradition of interval arithmetic for generating bounds on box shaped partition sets, the concept of monotonicity test is used in order to reduce dimension. This paper shows how such a concept can be extended to simplicial partition sets and how to elaborate it for the Standard Quadratic Program.
Original languageEnglish
Number of pages5
DOIs
Publication statusPublished - 12 Feb 2019

Fingerprint

Branch and bound method
Global optimization
Cones

Cite this

@conference{106f54c5b53f4bbab494a01317b80065,
title = "On function monotonicity in simplicial branch and bound",
abstract = "Branch and bound methods in Global Optimization guarantee to find the set of global minimum points up to a certain accuracy. Partition sets typically take the shape of boxes, cones and simplices. In the tradition of interval arithmetic for generating bounds on box shaped partition sets, the concept of monotonicity test is used in order to reduce dimension. This paper shows how such a concept can be extended to simplicial partition sets and how to elaborate it for the Standard Quadratic Program.",
author = "E.M.T. Hendrix and J.M.G. Salmer{\'o}n and L.G. Casado",
year = "2019",
month = "2",
day = "12",
doi = "10.1063/1.5089974",
language = "English",

}

On function monotonicity in simplicial branch and bound. / Hendrix, E.M.T.; Salmerón, J.M.G.; Casado, L.G.

2019.

Research output: Contribution to conferenceConference paperAcademicpeer-review

TY - CONF

T1 - On function monotonicity in simplicial branch and bound

AU - Hendrix, E.M.T.

AU - Salmerón, J.M.G.

AU - Casado, L.G.

PY - 2019/2/12

Y1 - 2019/2/12

N2 - Branch and bound methods in Global Optimization guarantee to find the set of global minimum points up to a certain accuracy. Partition sets typically take the shape of boxes, cones and simplices. In the tradition of interval arithmetic for generating bounds on box shaped partition sets, the concept of monotonicity test is used in order to reduce dimension. This paper shows how such a concept can be extended to simplicial partition sets and how to elaborate it for the Standard Quadratic Program.

AB - Branch and bound methods in Global Optimization guarantee to find the set of global minimum points up to a certain accuracy. Partition sets typically take the shape of boxes, cones and simplices. In the tradition of interval arithmetic for generating bounds on box shaped partition sets, the concept of monotonicity test is used in order to reduce dimension. This paper shows how such a concept can be extended to simplicial partition sets and how to elaborate it for the Standard Quadratic Program.

U2 - 10.1063/1.5089974

DO - 10.1063/1.5089974

M3 - Conference paper

ER -