D( C)-optimization and robust global optimization
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)
- Robust solution of nonconvex global optimization problems
- scientific article; zbMATH DE number 6311514
- D.C. optimization approach to robust control: Feasibility problems
- scientific article; zbMATH DE number 1488016
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- scientific article; zbMATH DE number 3770416 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 2190135 (Why is no real title available?)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A robust algorithm for quadratic optimization under quadratic constraints
- Convex programs with an additional reverse convex constraint
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- Fourier transforms and their Lipschitz classes
- Global optimization with polynomials and the problem of moments
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Monotonic Optimization: Branch and Cut Methods
- Monotonic optimization: Problems and solution approaches
- Optimization of polynomial fractional functions
- Robust solution of nonconvex global optimization problems
- 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
- A new concave reformulation and its application in solving DC programming globally under uncertain environment
- Problems with resource allocation constraints and optimization over the efficient set
- Robust solution of nonconvex global optimization problems
- 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)
