On nonconvex optimization problems with separated nonconvex variables

DOI10.1007/BF00122050MaRDI QIDQ1187838zbMATH OpenFDO

Authors Hoang Tuy

Publication date 13 August 1992

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

zbMATH Keywords

decompositionglobal optimizationouter approximationbranch and boundLipschitz optimizationreverse convex programminglower linearizationrelief indicator methodseparated nonconvex variables

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 3904344
• An Algorithm for Separable Nonconvex Programming Problems
• New Partitioning Method for a Class of Nonconvex Optimization Problems
• scientific article; zbMATH DE number 1292040
• A global optimization method for nonconvex separable programming problems

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 4185412 (Why is no real title available?)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Concave minimization under linear constraints with special structure
• Concave minimization via conical partitions and polyhedral outer approximation
• Constrained global optimization: algorithms and applications
• Convex Analysis
• Convex minimization under Lipschitz constraints
• Convex two-level optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Global minimization of large-scale constrained concave quadratic problems by separable programming

Cited in

(11)

• Separating variables to accelerate non-convex regularized optimization
• Separation of Nonconvex Sets with General Augmenting Functions
• What is quasiconvex analysis?
• A d.c. optimization method for single facility location problems
• An Algorithm for Separable Nonconvex Programming Problems
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Beyond canonical dc-optimization: the single reverse polar problem
• New Partitioning Method for a Class of Nonconvex Optimization Problems
• scientific article; zbMATH DE number 3904344 (Why is no real title available?)
• Outer approximation algorithms for canonical DC problems
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities

This page was built for publication: On nonconvex optimization problems with separated nonconvex variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187838)