A geometric branch and bound method for robust maximization of convex functions
From MaRDI portal
Publication:2052396
Abstract: We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm performs sequential piecewise-linear approximations of the convex objective, and solves linear programs to determine lower and upper bounds of nodes specified by the active linear pieces. Finite convergence of the algorithm to an optimal solution is proved. Numerical results are used to discuss the performance of the developed algorithm. The algorithm developed in this paper can be used as an oracle in the cutting surface method for solving robust optimization problems with compact ambiguity sets.
Recommendations
- Geometric branch-and-bound methods for constrained global optimization problems
- A robust algorithm for generalized geometric programming
- An axiomatic approach to robust geometric programs
- Tractable approximate robust geometric programming
- scientific article; zbMATH DE number 1895618
- Robustness of posynomial geometric programming optima
- Convex Maximization via Adjustable Robust Optimization
- An interval branch and bound method for global robust optimization
- A geometric method for a class of convex programs
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
Cites work
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A deterministic global optimization algorithm for generalized geometric programming
- A finite algorithm for global minimization of separable concave programs
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Design of computer experiments: space filling and beyond
- Deterministic global optimization. Theory, methods and applications
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Fractional programming with convex quadratic forms and functions
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- Global optimization of nonconvex polynomial programming problems having rational exponents
- GloptiPoly
- Guided dive for the spatial branch-and-bound
- scientific article; zbMATH DE number 1054673 (Why is no real title available?)
- scientific article; zbMATH DE number 1534292 (Why is no real title available?)
- scientific article; zbMATH DE number 3082712 (Why is no real title available?)
- Integer Programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Multisourcing supply network design: two-stage chance-constrained model, tractable approximations, and computational results
- On distributionally robust chance constrained programs with Wasserstein distance
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Robust convex optimization
- Robust optimization
- Robust solutions of uncertain linear programs
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Solving sum of ratios fractional programs via concave minimization
This page was built for publication: A geometric branch and bound method for robust maximization of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052396)
