Lagrange duality and partitioning techniques in nonconvex global optimization
From MaRDI portal
Publication:1372558
DOI10.1023/A:1022687222060zbMath0892.90162MaRDI QIDQ1372558
Publication date: 15 July 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
global optimization; duality gap; branch-and-bound techniques; sum of ratios; reverse convex constraints; bilinear constraints; partly convex programs
90C30: Nonlinear programming
Related Items
Duality bound method for the general quadratic programming problem with quadratic constraints, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints, On a decomposition method for nonconvex global optimization, Solving sum-of-ratios fractional programs using efficient points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Image space analysis of generalized fractional programs
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Global minimization by reducing the duality gap
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- Introduction to global optimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Jointly Constrained Biconvex Programming
- On the Duality Gap in Nonconvex Optimization
- On Maximizing a Sum of Ratios
- An algorithm for nonconvex programming problems
- Estimates of the Duality Gap in Nonconvex Optimization
- Programming with linear fractional functionals
- Lagrange Multipliers and Nonconvex Programs
- Convex Analysis
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- A Class of Fractional Programming Problems
