Pages that link to "Item:Q1848362"
From MaRDI portal
The following pages link to Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362):
Displaying 14 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Value-at-risk optimization using the difference of convex algorithm (Q1929961) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
- A combined global \& local search (CGLS) approach to global optimization (Q2494296) (← links)
- A difference of convex formulation of value-at-risk constrained optimization (Q3577837) (← links)
- Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets (Q3627699) (← links)
- (Q4552719) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
