A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
From MaRDI portal
Publication:2046554
DOI10.1007/S10957-021-01872-5zbMath1482.90207OpenAlexW3167336199MaRDI QIDQ2046554
Jen-Chih Yao, Markus A. Köbis, Yonghong Yao, Xiaopeng Zhao
Publication date: 18 August 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01872-5
multiobjective optimizationquasiconvex functionsPareto optimalityprojected subgradient methodquasi-Fejér convergence
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items (18)
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 ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ The inertial iterative extragradient methods for solving pseudomonotone equilibrium programming in Hilbert spaces ⋮ Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ 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 ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ 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 ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Lower subdifferentiable functions and their minimization by cutting planes
- On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Nonlinear multiobjective optimization
- Quasiconvex optimization and location theory
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- A weighting subgradient algorithm for multiobjective optimization
- A relaxed projection method for solving multiobjective optimization problems
- A projected gradient method for vector optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- New Farkas-type results for vector-valued functions: a non-abstract approach
- On the existence of Pareto solutions for polynomial vector optimization problems
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- An efficient sampling approach to multiobjective optimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- An Appropriate Subdifferential for Quasiconvex Functions
- On the convergence of the projected gradient method for vector optimization
- Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Strict lower subdifferentiability and applications
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Full convergence of the steepest descent method with inexact line searches
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
- A Subgradient Method for Vector Optimization Problems
- Convex Analysis
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
This page was built for publication: A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
