On the choice of parameters for the weighting method in vector optimization
From MaRDI portal
Publication:2467161
DOI10.1007/S10107-006-0071-7zbMATH Open1163.90021OpenAlexW2029509128MaRDI QIDQ2467161FDOQ2467161
B. F. Svaiter, L. M. Graña Drummond, Nelson 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
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
- Convex Analysis
- Theory of multiobjective optimization
- Nonlinear multiobjective optimization
- Scalarizing vector optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scalarization of vector optimization problems
- Scalarization in vector optimization
- An Existence Theorem in Vector Optimization
- General equilibrium analysis in ordered topological vector spaces
- Title not available (Why is that?)
- Equilibrium analysis in financial markets with countably many securities
Cited In (37)
- 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
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- Steepest descent methods for critical points in vector optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Title not available (Why is that?)
- On inexact projected gradient methods for solving variable vector optimization problems
- 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
- Tikhonov-type regularization method for efficient solutions in vector optimization
- A weighting subgradient algorithm for multiobjective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A modified Quasi-Newton method for vector optimization problem
- On some properties and an application of the logarithmic barrier method
- A unified vector optimization problem: complete scalarizations and applications
- On the convergence of steepest descent methods for multiobjective optimization
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Improved front steepest descent for multi-objective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- A memetic procedure for global multi-objective optimization
- Inertial forward–backward methods for solving vector optimization problems
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Inexact projected gradient method for vector optimization
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Weighting factor results in vector optimization
- Search method for the weighting matrix of the weighted multivariable circle criterion
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- On the convergence of the projected gradient method for 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)
