Combination between global and local methods for solving an optimization problem over the efficient set
From MaRDI portal
(Redirected from Publication:1848362)
Recommendations
- scientific article; zbMATH DE number 1086738
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- Conical algorithm in global optimization for optimizing over efficient sets
- Primal and dual algorithms for optimization over the efficient set
Cites work
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Algorithms for the vector maximization problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- scientific article; zbMATH DE number 4091200 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3378720 (Why is no real title available?)
- Introduction to global optimization
- Introduction to sensitivity and stability analysis in nonlinear programming
- Maximizing a concave function over the efficient or weakly-efficient set
- Minimization of a quasi-concave function over an efficient set
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On the continuity of the minimum set of a continuous function
- Optimization over the efficient set
- Optimization over the efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Utility function programs and optimization over the efficient set in multiple-objective decision making
Cited in
(14)- 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
- Value-at-risk optimization using the difference of convex algorithm
- A branch-and-bound algorithm embedded with DCA for DC programming
- Variations and extension of the convex-concave procedure
- On optimization over the efficient set in linear multicriteria programming
- A combined global \& local search (CGLS) approach to global optimization
- DC approximation approaches for sparse optimization
- A difference of convex formulation of value-at-risk constrained optimization
- Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- scientific article; zbMATH DE number 1795199 (Why is no real title available?)
- Primal and dual algorithms for optimization over the efficient set
- Open issues and recent advances in DC programming and DCA
This page was built for publication: Combination between global and local methods for solving an optimization problem over the efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848362)
