\({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization

DOI10.1007/s10898-009-9475-2zbMath1200.90140OpenAlexW2043537261MaRDI QIDQ989898

Hoang Tuy

Publication date: 23 August 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9475-2

zbMATH Keywords

nonconvex global optimizationapproximate optimal solutionrobust approach\({{\mathcal {D}(\mathcal {C})}}\)-optimizationdc optimizationdm (monotonic) optimizationessential optimal solutionsuccessive incumbent transcending algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (5)

Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems ⋮ A new topological minimax theorem with application ⋮ Problems with resource allocation constraints and optimization over the efficient set ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex programs with an additional reverse convex constraint
• Fourier transforms and their Lipschitz classes
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Optimization of polynomial fractional functions
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• A robust algorithm for quadratic optimization under quadratic constraints
• Robust solution of nonconvex global optimization problems
• Monotonic Optimization: Problems and Solution Approaches
• Global Optimization with Polynomials and the Problem of Moments
• Monotonic Optimization: Branch and Cut Methods
• Discrete Monotonic Optimization with Application to a Discrete Location Problem

This page was built for publication: \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization