On the convergence of the projected gradient method for vector optimization
From MaRDI portal
Recommendations
- Inexact projected gradient method for vector optimization
- A projected gradient method for vector optimization problems
- A subgradient method for vector optimization problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites work
- A projected gradient method for vector optimization problems
- 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
- Dominating sets for convex functions with some applications
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Equilibrium analysis in financial markets with countably many securities
- Full convergence of the steepest descent method with inexact line searches
- General equilibrium analysis in ordered topological vector spaces
- Newton's method for multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On the choice of parameters for the weighting method in vector optimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Steepest descent methods for multicriteria optimization.
Cited in
(68)- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A projected gradient method for vector optimization problems
- Conditional gradient method for multiobjective optimization
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- On inexact projected gradient methods for solving variable vector optimization problems
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Inexact projected gradient method for vector optimization
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- Convergence analysis of projected gradient descent for Schatten-p nonconvex matrix recovery
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Newton-like methods for solving vector optimization problems
- An external penalty-type method for multicriteria
- On the Identification Property of a Projected Gradient Method
- Convergence properties of inexact projected gradient methods
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- scientific article; zbMATH DE number 1146103 (Why is no real title available?)
- 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
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- On high-order model regularization for multiobjective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- A barrier-type method for multiobjective optimization
- A quadratically convergent Newton method for vector optimization
- On the convergence properties of the projected gradient method for convex optimization
- A subgradient method for vector optimization problems
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Multiobjective conjugate gradient methods on Riemannian manifolds
- A memetic procedure for global multi-objective optimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- A line search technique for a class of multi-objective optimization problems using subgradient
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- Accelerated nonmonotone line search technique for multiobjective optimization
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A nonmonotone line search method for constrained multiobjective optimization problems
- A novel hybrid conjugate gradient method for multiobjective optimization problems
- A hybrid gradient method for vector optimization problems
- A proximal gradient method with an explicit line search for multiobjective optimization
- A modified Polak-Ribière-Polyak type conjugate gradient method for vector optimization
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- A reduced Jacobian method with full convergence property
- Improved convergence rates for the multiobjective Frank-Wolfe method
- A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems
- A generalized conditional gradient method for multiobjective composite optimization problems
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- Convergence of one-step projected gradient methods for variational inequalities
- The projected gradient direction in vector optimization: continuity and dual characterization
- The generalized conditional gradient method for multiobjective composite optimization problems with non-monotone line search
- New computable algorithms for smooth multiobjective optimization problems
- A proximal point-type method for multicriteria optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- Charnes-Cooper scalarization and convex vector optimization
This page was built for publication: On the convergence of the projected gradient method for vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112500)
