On nonconvex optimization problems with separated nonconvex variables
From MaRDI portal
Publication:1187838
DOI10.1007/BF00122050zbMath0778.90055MaRDI QIDQ1187838
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationreverse convex programmingdecompositionLipschitz optimizationbranch and boundouter approximationlower linearizationrelief indicator methodseparated nonconvex variables
Related Items
A d.c. optimization method for single facility location problems, Beyond canonical dc-optimization: the single reverse polar problem, Polyhedral annexation, dualization and dimension reduction technique in global optimization, Outer approximation algorithms for canonical DC problems, What is quasiconvex analysis?
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Concave minimization via conical partitions and polyhedral outer approximation
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Constrained global optimization: algorithms and applications
- Convex two-level optimization
- Convex minimization under Lipschitz constraints
- Concave minimization under linear constraints with special structure
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Convex Analysis
