Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
From MaRDI portal
Recommendations
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
Cites work
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
- A new scalarization technique and new algorithms to generate Pareto fronts
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A projected gradient method for vector optimization problems
- A subgradient method for vector optimization problems
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An efficient sampling approach to multiobjective optimization
- Approximate proximal methods in vector optimization
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Full convergence of the steepest descent method with inexact line searches
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 47208 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- On the choice of parameters for the weighting method in vector optimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- On the nonmonotone line search
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Steepest descent methods for multicriteria optimization.
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
Cited in
(23)- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems on Riemannian manifolds
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- An accelerated proximal gradient method for multiobjective optimization
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- Extension of the projected gradient and Armijo's rule concepts for solving convex nonlinear multiobjective optimization problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Second-order Karush/Kuhn–Tucker conditions and duality for constrained multiobjective optimization problems
- Computing the set of optimal points for nonconvex multi-objective optimization problems
This page was built for publication: Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383208)
