On the choice of parameters for the weighting method in vector optimization
From MaRDI portal
Publication:2467161
DOI10.1007/s10107-006-0071-7zbMath1163.90021OpenAlexW2029509128MaRDI QIDQ2467161
L. M. Graña Drummond, Benar Fux Svaiter, Nelson F. Maculan
Publication date: 21 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0071-7
Related Items (31)
On inexact projected gradient methods for solving variable 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 modified Quasi-Newton method for vector optimization problem ⋮ Inexact projected gradient method for vector optimization ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ An inexact steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ 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 ⋮ 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 ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ On some properties and an application of the logarithmic barrier method ⋮ A weighting subgradient algorithm for multiobjective optimization ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Accelerated diagonal steepest descent method for unconstrained multiobjective optimization ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ On the convergence of the projected gradient method for vector optimization ⋮ On the convergence of steepest descent methods for multiobjective optimization ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equilibrium analysis in financial markets with countably many securities
- Theory of multiobjective optimization
- Scalarization of vector optimization problems
- Nonlinear multiobjective optimization
- Scalarizing vector optimization problems
- General equilibrium analysis in ordered topological vector spaces
- Scalarization in vector optimization
- An Existence Theorem in Vector Optimization
- Convex Analysis
This page was built for publication: On the choice of parameters for the weighting method in vector optimization
