Non-convex multi-objective optimization
The book deals with theoretical properties and solution methods of multi-ubjective optimization problems of the following form: \[ \min_{x \in A} f(x) = (f_1(x),_1, \dots, f_m(x)_m)^T, \] where \(f: A ~\longmapsto~\mathbb R^m\) and \(A = \{ x \in \mathbb R^d ~|~ g_j(x) \leq 0, ~ j = 1, \dots, k \}\). The book has 10 chapters divided into 3 parts. Part I (Chapters 1--4) has an introductory character. The authors introduce definitions of basic concepts together with illustrative examples and explain main ideas of four scalarization approaches to multi-objective problems, namely Chebyshev approach, using achivement scalarization function, an approach based on successive minimization of components \(f_k(x)\) for \(k = 1, \dots, m\) under the constraints \(f_i(x) \leq f_k(x), ~i = 1, \dots, m, i \neq k\), and Pascoletti-Serafini scalarization. Pareto-optimality of the resulting compromise vectors is proved. Existence of polynomial complexity approximations of the NP-complete multi-objective problems is investigated in Chapter 3. A brief review of solution methods for single-objective non-convex optimization problems is presented in Chapter 4. Part II (Chapters 5--8) is devoted to the description of algorithms solving multi-objective optimization problems. The authors extend theoretically substantiated methods of single-objective global optimization problems presented in Chapter 4 of Part I to multi-objective optimization. Optimization algorithms for the case of Lipschitz continuous components of objective function \(f(x)\), statistical models for global optimization as well as branch and probability bounds methods are extended to multi-objective optimization. Further it is shown how visualiation of the Pareto-front estimates can help to solve some of the multi-objective problems. Part III (Chapters 9--10) is devoted to applications of the developed techniques to analysis of business process diagrams. The authors consider also applications to manufacturing and chemical process engineering.
- Nonlinear multiobjective optimization. A generalized homotopy approach
- Efficient multicriterial optimization based on intensive reuse of search information
- On the extension of the \textsc{direct} algorithm to multiple objectives
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization
- Nonconvex constrained optimization by a filtering branch and bound
- A general branch-and-bound framework for continuous global multiobjective optimization
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- An optimization method for chaotic turbulent flow
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Recent trends on nonlinear filtering for inverse problems
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- Multi-objective evolutionary algorithms for a reliability location problem
- Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions
- On efficiency of a single variable bi-objective optimization algorithm
- DMaOEA-\(\varepsilon\)C: decomposition-based many-objective evolutionary algorithm with the \(\varepsilon\)-constraint framework
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- Understanding the Impact of Constraints: A Rank Based Fitness Function for Evolutionary Methods
- Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- A hybrid of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- A Partition Based Bayesian Multi-objective Optimization Algorithm
- Multi-objective optimization and decision visualization of batch stirred tank reactor based on spherical catalyst particles
- Branch and probability bound methods in multi-objective optimization
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- Filtering Methods for Coupled Inverse Problems
- Multiobjective Optimization: An Overview
- Robust second order cone conditions and duality for multiobjective problems under uncertainty data
- Multi-objective Lichtenberg algorithm for the optimum design of truss structures
- Hybrid intelligent multi-objective optimal control of ODE-constrained nonlinear systems
- A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization
- Learning to optimize by multi-gradient for multi-objective optimization
- The NFDA-nonsmooth feasible directions algorithm applied to constructing Pareto fronts of ridge and Lasso regressions
- Comparative efficiency of machine learning models for enhancing algorithms in solving multiextremal multicriteria problems
- Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
- Multiobjective optimization by using cutting angle methods and hypervolume criterion
- A novel neural network model and two new algorithms for solving multiobjective linear optimization problems
- -competitiveness. An approach to multi-objective optimization with high computation costs in Lipschitz functions
- An open-source parallel algorithm of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
This page was built for publication: Non-convex multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360302)
