Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
From MaRDI portal
Publication:700712
DOI10.1023/A:1014865432210zbMath1009.90092OpenAlexW1509979919MaRDI QIDQ700712
Publication date: 8 October 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014865432210
global optimizationdecompositionnonconvex optimizationbranch-and-bound schemesnonlinear parametric optimization
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Decomposition methods (49M27)
Related Items
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints, Criteria and dimension reduction of linear multiple criteria optimization problems, A convex analysis approach for convex multiplicative programming, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, On a decomposition method for nonconvex global optimization, A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints, On optimization over the efficient set in linear multicriteria programming, Duality bound method for the general quadratic programming problem with quadratic constraints, A continuous approch for globally solving linearly constrained quadratic, On duality bound methods for nonconvex global optimization, Combination between global and local methods for solving an optimization problem over the efficient set, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Introduction to sensitivity and stability analysis in nonlinear programming
- Partitioning procedures for solving mixed-variables programming problems
- Method for minimizing a convex-concave function over a convex set
- A global optimization approach for solving the convex multiplicative programming problem
- Linear multiplicative programming
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Primal-relaxed dual global optimization approach
- Global minimization by reducing the duality gap
- Constraint decomposition algorithms in global optimization
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Maximizing a concave function over the efficient or weakly-efficient set
- Introduction to global optimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- On the continuity of the minimum set of a continuous function
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A Successive Underestimation Method for Concave Minimization Problems
- Algorithms for the vector maximization problem
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Point-to-Set Maps in Mathematical Programming
- Optimization over the efficient set
- Optimization over the efficient set
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Conical algorithm in global optimization for optimizing over efficient sets
