Simplicially-constrained DC optimization over efficient and weakly efficient sets

DOI10.1023/A:1023993504522MaRDI QIDQ1411519zbMATH OpenOpenAlexFDO

Authors Le Dung Muu, Le Thi Hoai An, Pham Dinh Tao

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

zbMATH Keywords

convex envelopesDC programmingexact penalty functionsOptimization over efficient setsoptimization over weakly efficient setssimplicially-constrained DC optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Recommendations

• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• scientific article; zbMATH DE number 1086738
• Characterizations of efficient sets by constrained objectives
• Solving Optimization Problems over the Weakly Efficient Set
• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem

Cites work

• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
• A Successive Underestimation Method for Concave Minimization Problems
• Algorithms for the vector maximization problem
• An algorithm for optimizing over the weakly-efficient set
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• Computational aspects of optimization problems over the efficient set
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• D.c sets, d.c. functions and nonlinear equations
• Dual approach to minimization on the set of Pareto-optimal solutions
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 592648 (Why is no real title available?)
• scientific article; zbMATH DE number 1086738 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• Minimization of a quasi-concave function over an efficient set
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Optimization on low rank nonconvex structures
• Optimization over the efficient set
• Optimization over the efficient set
• Utility function programs and optimization over the efficient set in multiple-objective decision making

Cited in

(12)

• 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
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
• On DC optimization algorithms for solving minmax flow problems
• 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
• Solving Optimization Problems over the Weakly Efficient Set
• Bilevel optimization: theory, algorithms, applications and a bibliography
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• Open issues and recent advances in DC programming and DCA
• A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems

This page was built for publication: Simplicially-constrained DC optimization over efficient and weakly efficient sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411519)