Deterministic methods in constrained global optimization: Some recent advances and new fields of application
DOI<433::AID-NAV3220370403>3.0.CO;2-2 10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2zbMath0709.90093OpenAlexW2077519839MaRDI QIDQ3494393
Publication date: 1990
Full work available at URL: https://doi.org/10.1002/1520-6750(199008)37:4<433::aid-nav3220370403>3.0.co;2-2
surveyconcave minimizationd.c. programmingouter approximationconstrained global optimizationbranch-and- bounddeterministic methodsLipschitzian optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Approximate first-order and second-order directional derivatives of a marginal function in convex optimization
- On functions representable as a difference of convex functions
- Concave minimization via conical partitions and polyhedral outer approximation
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- Constrained global optimization: algorithms and applications
- Optimization with disjunctive constraints
- Convex minimization under Lipschitz constraints
- Methods of descent for nondifferentiable optimization
- Performance of approximate algorithms for global minimization
- Nonlinear cost network models in transportation analysis
- Global minimization of a difference of two convex functions
- An implicit enumeration procedure for the general linear complementarity problem
- Methods of Nonlinear 0-1 Programming
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Aanwendung des erweiterungsprinzips zur lösung konkayer optimierungsaufgaben
- Characterization of linear complementarity problems as linear programs