Decomposition approach for the global minimization of biconcave functions over polytopes

DOI10.1007/BF02192199zbMath0851.90116OpenAlexW2010888735MaRDI QIDQ1918288

Reiner Horst, Nguyen Van Thoai

Publication date: 31 July 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192199

zbMATH Keywords

branch-and-boundouter approximationdecomposition approachpolyhedral partitionbiconcave functions over polytopes

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Lagrange duality and partitioning techniques in nonconvex global optimization, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, Biconvex sets and optimization with biconvex functions: a survey and extensions, Continuous relaxation for discrete DC programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, On the global optimization of sums of linear fractional functions over a convex set, Global optimization for the sum of concave-convex ratios problem, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints

Cites Work

• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
• Concave minimization via conical partitions and polyhedral outer approximation
• On the convergence of global methods in multiextremal optimization
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• On-line and off-line vertex enumeration by adjacency lists
• A global optimization approach for solving the convex multiplicative programming problem
• Constraint decomposition algorithms in global optimization
• A new algorithm for solving the general quadratic programming problem
• Jointly Constrained Biconvex Programming
• Concave minimization under linear constraints with special structure
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• Unnamed Item