Convergence of the projected gradient method for quasiconvex multiobjective optimization
From MaRDI portal
Publication:555040
DOI10.1016/J.NA.2011.04.067zbMATH Open1225.90114OpenAlexW2085491742MaRDI QIDQ555040FDOQ555040
Authors: Jianyong Qiao, Sumit K. Garg 
Publication date: 22 July 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.04.067
Recommendations
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- Convergence of a projected gradient method variant for quasiconvex objectives
multiobjective optimizationPareto-optimalityArmijo-type searchprojected gradient methodsquasiconvex multiobjective functions
Cites Work
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- Optimality conditions for set-valued optimization problems
- A characterization of quasiconvex vector-valued functions
- Title not available (Why is that?)
- Dominating sets for convex functions with some applications
- Proximal Methods in Vector Optimization
- Convergence of a projected gradient method variant for quasiconvex objectives
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- An efficient sampling approach to multiobjective optimization
- Newton's method for multiobjective optimization
- Title not available (Why is that?)
- Scalarization in vector optimization
- Full convergence of the steepest descent method with inexact line searches
- On the choice of parameters for the weighting method in vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Convergence of the gradient projection method for generalized convex minimization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
Cited In (41)
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- A proximal gradient splitting method for solving convex vector optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
- Multiobjective BFGS method for optimization on Riemannian manifolds
- On inexact projected gradient methods for solving variable vector optimization problems
- An incremental descent method for multi-objective optimization
- A steepest descent-like method for variable order vector optimization problems
- A subgradient-like algorithm for solving vector convex inequalities
- A proximal point-type method for multicriteria optimization
- Convergence of inexact quasisubgradient methods with extrapolation
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- A steepest descent-like method for vector optimization problems with variable domination structure
- Convergence of a projected gradient method variant for quasiconvex objectives
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- A relaxed projection method for solving multiobjective optimization problems
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- A strongly convergent proximal point method for vector optimization
- Newton-like methods for solving vector optimization problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A projected gradient method for vector optimization problems
- Proximal Newton methods for multiobjective optimization problems
- On the convergence properties of the projected gradient method for convex optimization
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
Uses Software
This page was built for publication: Convergence of the projected gradient method for quasiconvex multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555040)
