On the choice of parameters for the weighting method in vector optimization
From MaRDI portal
Publication:2467161
Recommendations
- Weighting factor results in vector optimization
- On convex vector optimization problems with possibilistic weights
- The weighting method and multiobjective programming under new concepts of generalized (\phi,\rho)-invexity
- A weighting subgradient algorithm for multiobjective optimization
- The weighted sum method for multi-objective optimization: new insights
Cites work
- An Existence Theorem in Vector Optimization
- Convex Analysis
- Equilibrium analysis in financial markets with countably many securities
- General equilibrium analysis in ordered topological vector spaces
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 2156773 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Nonlinear multiobjective optimization
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Scalarizing vector optimization problems
- Theory of multiobjective optimization
Cited in
(43)- Weighting factor results in vector optimization
- A weighting subgradient algorithm for multiobjective optimization
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- On inexact projected gradient methods for solving variable vector optimization problems
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Inexact projected gradient method for vector optimization
- Newton-like methods for efficient solutions in vector optimization
- On some properties and an application of the logarithmic barrier method
- A unified vector optimization problem: complete scalarizations and applications
- On the convergence of the projected gradient method for vector optimization
- Steepest descent methods for critical points in vector optimization problems
- Inertial forward–backward methods for solving vector optimization problems
- scientific article; zbMATH DE number 3883960 (Why is no real title available?)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A modified Quasi-Newton method for vector optimization problem
- Search method for the weighting matrix of the weighted multivariable circle criterion
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- A steepest descent-like method for variable order vector optimization problems
- A subgradient-like algorithm for solving vector convex inequalities
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- A steepest descent-like method for vector optimization problems with variable domination structure
- A nonmonotone gradient method for constrained multiobjective optimization problems
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Improved front steepest descent for multi-objective optimization
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Pareto front approximation through a multi-objective augmented Lagrangian method
- A memetic procedure for global multi-objective optimization
- An interior proximal method in vector optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Learning to optimize by multi-gradient for multi-objective optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- On contextual inverse multiobjective problems
- On the computation of the efficient frontier in advanced sparse portfolio optimization
- A new hybrid conjugate gradient method for multiobjective optimization on Riemannian manifolds
- On the convergence of steepest descent methods for multiobjective optimization
- Tikhonov-type regularization method for efficient solutions in vector optimization
This page was built for publication: On the choice of parameters for the weighting method in vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467161)
