Combination between global and local methods for solving an optimization problem over the efficient set

DOI10.1016/S0377-2217(01)00301-0zbMath1082.90563OpenAlexW2012420075MaRDI QIDQ1848362

Hoai An Le Thi, Tao Pham Dinh, Nguyen Van Thoai

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00301-0

zbMATH Keywords

Global optimizationBranch and boundD.c. programmingMultiple objective optimizationOptimization over efficient sets

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of a quasi-concave function over an efficient set
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• Introduction to sensitivity and stability analysis in nonlinear programming
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Utility function programs and optimization over the efficient set in multiple-objective decision making
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Maximizing a concave function over the efficient or weakly-efficient set
• Introduction to global optimization
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
• On the continuity of the minimum set of a continuous function
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Algorithms for the vector maximization problem
• Optimization over the efficient set
• Optimization over the efficient set
• Conical algorithm in global optimization for optimizing over efficient sets

Related Items (12)

Variations and extension of the convex-concave procedure ⋮ DC approximation approaches for sparse optimization ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Value-at-risk optimization using the difference of convex algorithm ⋮ Open issues and recent advances in DC programming and DCA ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ On optimization over the efficient set in linear multicriteria programming ⋮ DC programming and DCA: thirty years of developments ⋮ A difference of convex formulation of value-at-risk constrained optimization ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets

This page was built for publication: Combination between global and local methods for solving an optimization problem over the efficient set