A geometric branch and bound method for robust maximization of convex functions
From MaRDI portal
Publication:2052396
DOI10.1007/s10898-021-01038-7zbMath1481.90241arXiv1911.08719OpenAlexW3166163032MaRDI QIDQ2052396
Publication date: 26 November 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.08719
robust optimizationfinite set of candidate functionsgeometric branch and boundmaximization of convex functions
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Robustness in mathematical programming (90C17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design of computer experiments: space filling and beyond
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Robust solutions of uncertain linear programs
- A finite algorithm for global minimization of separable concave programs
- Global optimization of nonconvex polynomial programming problems having rational exponents
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Guided dive for the spatial branch-and-bound
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Deterministic global optimization. Theory, methods and applications
- On distributionally robust chance constrained programs with Wasserstein distance
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Global optimization for the sum of generalized polynomial fractional functions
- Solving sum of ratios fractional programs via concave minimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Fractional programming with convex quadratic forms and functions
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A deterministic global optimization algorithm for generalized geometric programming
- Robust Convex Optimization
- Algorithm 950
- Semi-Infinite Programming: Theory, Methods, and Applications
- Integer Programming
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results
- GloptiPoly
- Global optimization of nonconvex factorable programming problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
