A barrier-type method for multiobjective optimization
From MaRDI portal
Abstract: For solving constrained multicriteria problems, we introduce the multiobjective barrier method (MBM), which extends the scalar-valued internal penalty method. This multiobjective version of the classical method also requires a penalty barrier for the feasible set and a sequence of nonnegative penalty parameters. Differently from the single-valued procedure, MBM is implemented by means of an auxiliary "monotonic" real-valued mapping, which may be chosen in a quite large set of functions. Here, we consider problems with continuous objective functions, where the feasible sets are defined by finitely many continuous inequalities. Under mild assumptions, and depending on the monotonicity type of the auxiliary function, we establish convergence to Pareto or weak Pareto optima. Finally, we also propose an implementable version of MBM for seeking local optima and analyze its convergence to Pareto or weak Pareto solutions.
Recommendations
Cites work
- A projected gradient method for vector optimization problems
- A quadratically convergent Newton method for vector optimization
- A steepest descent method for vector optimization
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- An efficient sampling approach to multiobjective optimization
- An external penalty-type method for multicriteria
- Dominating sets for convex functions with some applications
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Generalized proximal point algorithms for multiobjective optimization problems
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 47208 (Why is no real title available?)
- Inexact projected gradient method for vector optimization
- Newton's method for multiobjective optimization
- Nonlinear programming
- Nonlinear Programming
- On the convergence of the projected gradient method for vector optimization
- Proximal Methods in Vector Optimization
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Steepest descent methods for multicriteria optimization.
Cited in
(11)- An external penalty-type method for multicriteria
- scientific article; zbMATH DE number 123727 (Why is no real title available?)
- scientific article; zbMATH DE number 2146464 (Why is no real title available?)
- A conjugate directions-type procedure for quadratic multiobjective optimization
- A logarithmic barrier function method for solving nonlinear multiobjective programming problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- On necessary optimality conditions for sets of points in multiobjective optimization
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
- An augmented Lagrangian algorithm for multi-objective optimization
This page was built for publication: A barrier-type method for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151514)
