A standard branch-and-bound approach for nonlinear semi-infinite problems
type: Item
instance of: scholarly article
title: A standard branch-and-bound approach for nonlinear semi-infinite problems
zbMATH Open document ID: 1430.90536
author: Antoine Marendet
author: Alexandre Goldsztejn
author: Gilles Chabert
author: Christophe Jermann
published in: European Journal of Operational Research
publication date: 2020-01-08T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7148654
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: branch-and-bound
zbMATH Keywords: relaxation
zbMATH Keywords: restriction
zbMATH Keywords: constraint programming
describes a project that uses: INTOPT_90
describes a project that uses: SoPlex
describes a project that uses: BARON
describes a project that uses: GAMS
describes a project that uses: Numerica
describes a project that uses: Arb
describes a project that uses: gaol
describes a project that uses: IBEX
describes a project that uses: IbexOpt
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2019.10.025
OpenAlex ID: W2982639800
cites work: Upper bounding in inner regions for global optimization under inequality constraints
cites work: Optimization of a one-dimensional hypertelescope for a direct imaging in astronomy
cites work: Q3182207
cites work: Deriving robust counterparts of nonlinear uncertain inequalities
cites work: Interval methods for semi-infinite programs
cites work: Infinitely constrained optimization problems
cites work: A branch and prune algorithm for the computation of generalized aspects of parallel robots
cites work: Generalized gradients of Lipschitz functionals
cites work: Generalized Gradients and Applications
cites work: Q4949361
cites work: A branch and bound algorithm for quantified quadratic programming
cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: Recent advances in robust optimization: an overview
cites work: Constraint qualifications in convex vector semi-infinite optimization
cites work: Robust solutions to multi-objective linear programs with uncertain data
cites work: First order rejection tests for multiple-objective optimization
cites work: Efficient handling of universally quantified inequalities
cites work: How do you compute the midpoint of an interval?
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Nonlinear robust optimization via sequential convex bilevel programming
cites work: Q2713275
cites work: Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
cites work: The cluster problem in constrained global optimization
cites work: Q5001955
cites work: Rigorous global search: continuous problems
cites work: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
cites work: Semi-infinite programming
cites work: Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
cites work: Global optimization of semi-infinite programs via restriction of the right-hand side
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: Q5566070
cites work: Second-order sufficient optimality conditions for local and global nonlinear programming
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Adaptive constructive interval disjunction: algorithms and experiments
cites work: How to solve a semi-infinite optimization problem
cites work: Discretization in semi-infinite programming: the rate of convergence
cites work: Constructive Interval Disjunction
cites work: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
cites work: The cluster problem revisited
cites work: Q4346087
cites work: Robustness in nonsmooth nonlinear multi-objective programming
DOI: 10.1016/J.EJOR.2019.10.025
description: scientific article; zbMATH DE number 7148654