D( C)-optimization and robust global optimization
DOI10.1007/S10898-009-9475-2zbMATH Open1200.90140OpenAlexW2043537261MaRDI QIDQ989898FDOQ989898
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
nonconvex global optimizationapproximate optimal solutionrobust approach\({{\mathcal {D}(\mathcal {C})}}\)-optimizationdc optimizationdm (monotonic) optimizationessential optimal solutionsuccessive incumbent transcending algorithm
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Optimization of polynomial fractional functions
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Robust solution of nonconvex global optimization problems
- A robust algorithm for quadratic optimization under quadratic constraints
- Monotonic optimization: Problems and solution approaches
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- Convex programs with an additional reverse convex constraint
- Fourier transforms and their Lipschitz classes
- Monotonic Optimization: Branch and Cut Methods
Cited In (5)
- Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A new topological minimax theorem with application
- Problems with resource allocation constraints and optimization over the efficient set
- Large-scale standard pooling problems with constrained pools and fixed demands
This page was built for publication: \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989898)
