Simplicially-constrained DC optimization over efficient and weakly efficient sets
From MaRDI portal
Publication:1411519
DOI10.1023/A:1023993504522zbMath1044.90071OpenAlexW207658221MaRDI QIDQ1411519
Le Dung Muu, Hoai An Le Thi, Tao Pham Dinh
Publication date: 29 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023993504522
convex envelopesexact penalty functionsDC programmingOptimization over efficient setsoptimization over weakly efficient setssimplicially-constrained DC optimization
Related Items (10)
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ On DC optimization algorithms for solving minmax flow problems ⋮ 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 ⋮ Exact penalty and error bounds in DC programming ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ DC programming and DCA: thirty years of developments ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Solving Optimization Problems over the Weakly Efficient Set ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization of a quasi-concave function over an efficient set
- An algorithm for optimizing over the weakly-efficient set
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- 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
- Optimization on low rank nonconvex structures
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Computational aspects of optimization problems over the efficient set
- Dual approach to minimization on the set of Pareto-optimal solutions
- D.c sets, d.c. functions and nonlinear equations
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- A Successive Underestimation Method for Concave Minimization Problems
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set
This page was built for publication: Simplicially-constrained DC optimization over efficient and weakly efficient sets
