Pages that link to "Item:Q2564625"

The following pages link to Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625):

Displaying 37 items.

• On DC optimization algorithms for solving minmax flow problems (Q406644) (← links)
• Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
• Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem (Q467441) (← links)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
• Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
• DC programming: overview. (Q1969457) (← links)
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
• Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net (Q2278891) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
• Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case (Q2351525) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• Semivectorial bilevel optimization problem: penalty approach (Q2370057) (← links)
• On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• (Q3303387) (← links)
• Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
• Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets (Q3627699) (← links)
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
• Solving Optimization Problems over the Weakly Efficient Set (Q4985181) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem (Q5940038) (← links)
• Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)
• Regularized linear discriminant analysis via a new difference-of-convex algorithm with extrapolation (Q6142181) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)