Lagrange duality and partitioning techniques in nonconvex global optimization

DOI10.1023/A:1022687222060zbMath0892.90162OpenAlexW1535017214MaRDI QIDQ1372558

Reiner Horst, Mirjam Dür

Publication date: 15 July 1998

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

Full work available at URL: https://doi.org/10.1023/a:1022687222060

zbMATH Keywords

global optimizationduality gapbranch-and-bound techniquessum of ratiosreverse convex constraintsbilinear constraintspartly convex programs

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints, Convergence-order analysis of branch-and-bound algorithms for constrained problems, 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, Comparison of MINLP formulations for global superstructure optimization, On the relation between concavity cuts and the surrogate dual for convex maximization problems, On a decomposition method for nonconvex global optimization, Solving sum-of-ratios fractional programs using efficient points, Duality bound method for the general quadratic programming problem with quadratic constraints, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A new algorithm for concave quadratic programming, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, A scalable global optimization algorithm for stochastic nonlinear programs, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints

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