A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
From MaRDI portal
Publication:2046554
In the paper under review, the authors provide a projected subgradient algorithm for solving constrained nondifferentiable quasiconvex multiobjective optimization problems. Under certain assumptions, the convergence of the sequence generated by the algorithm to a Pareto efficient solution of the problem is established. Some numerical examples are also presented to illustrate the performance of the suggested algorithm.
Recommendations
- A subgradient method for multiobjective optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A subgradient method for vector optimization problems
Cites work
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A projected gradient method for vector optimization problems
- A relaxed projection method for solving multiobjective optimization problems
- A subgradient method for multiobjective optimization
- A subgradient method for vector optimization problems
- A trust-region algorithm for heterogeneous multiobjective optimization
- A weighting subgradient algorithm for multiobjective optimization
- An appropriate subdifferential for quasiconvex functions
- An efficient sampling approach to multiobjective optimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Approximate proximal methods in vector optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convex Analysis
- 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 47208 (Why is no real title available?)
- scientific article; zbMATH DE number 7426946 (Why is no real title available?)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Lower subdifferentiable functions and their minimization by cutting planes
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- New Farkas-type results for vector-valued functions: a non-abstract approach
- Nonlinear multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On Projection Algorithms for Solving Convex Feasibility Problems
- On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- On the convergence of the projected gradient method for vector optimization
- On the existence of Pareto solutions for polynomial vector optimization problems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Quasiconvex optimization and location theory
- Strict lower subdifferentiability and applications
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
Cited in
(34)- A forward-backward-forward algorithm for solving quasimonotone variational inequalities
- \(S\)-derivative of perturbed mapping and solution mapping for parametric vector equilibrium problems
- A strong convergence theorem for solving an equilibrium problem and a fixed point problem using the Bregman distance
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- An inertial iterative algorithm for generalized equilibrium problems and Bregman relatively nonexpansive mappings in Banach spaces
- A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
- A self-adaptive extragradient algorithm for solving quasimonotone variational inequalities
- The inertial iterative extragradient methods for solving pseudomonotone equilibrium programming in Hilbert spaces
- Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities
- A subgradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Inertial primal-dual dynamics with damping and scaling for linearly constrained convex optimization problems
- Extension of the projected gradient and Armijo's rule concepts for solving convex nonlinear multiobjective optimization problems
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
- scientific article; zbMATH DE number 7709325 (Why is no real title available?)
- Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
- 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
- A line search technique for a class of multi-objective optimization problems using subgradient
- A self-adaptive inertial algorithm for bilevel pseudo-monotone variational inequality problems with non-Lipschitz mappings
- An inexact proximal point method for quasiconvex multiobjective optimization
- A subgradient projection method for quasiconvex minimization
- A subgradient projection method for quasiconvex multiobjetive optimization
- A subgradient supported ellipsoid method for convex multiobjective optimization problems
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
- Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
- Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization
This page was built for publication: A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046554)
