Numerical solution for optimization over the efficient set by d.c. optimization algorithms
From MaRDI portal
Publication:2564625
DOI10.1016/0167-6377(96)00022-3zbMath0871.90074OpenAlexW1967660666WikidataQ127352802 ScholiaQ127352802MaRDI QIDQ2564625
Hoai An Le Thi, Tao Pham Dinh, Le Dung Muu
Publication date: 4 February 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(96)00022-3
Related Items
Variations and extension of the convex-concave procedure, Semivectorial bilevel optimization problem: penalty approach, Unnamed Item, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, DC semidefinite programming and cone constrained DC optimization. I: Theory, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Holistic fleet optimization incorporating system design considerations, On DC optimization algorithms for solving minmax flow problems, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Regularized linear discriminant analysis via a new difference-of-convex algorithm with extrapolation, A bundle-type method for nonsmooth DC programs, Open issues and recent advances in DC programming and DCA, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, Criteria and dimension reduction of linear multiple criteria optimization problems, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem, DC programming: overview., A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, On optimization over the efficient set in linear multicriteria programming, DC programming and DCA: thirty years of developments, Accelerating the DC algorithm for smooth functions, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A continuous approch for globally solving linearly constrained quadratic, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net, Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, Solving Optimization Problems over the Weakly Efficient Set, Double regularization methods for robust feature selection and SVM classification via DC programming, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Combination between global and local methods for solving an optimization problem over the efficient set, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Computing the nadir point for multiobjective discrete optimization problems, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
Cites Work
- Convergence of a subgradient method for computing the bound norm of matrices
- Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function
- 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
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
- Partial regularization of the sum of two maximal monotone operators
- Algorithms for the vector maximization problem
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Optimization over the efficient set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
