A subgradient method for multiobjective optimization
From MaRDI portal
Recommendations
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- scientific article; zbMATH DE number 3887449
- A subgradient method for multiobjective optimization on Riemannian manifolds
- A subgradient method for vector optimization problems
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
Cites work
- scientific article; zbMATH DE number 3921337 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 713727 (Why is no real title available?)
- scientific article; zbMATH DE number 1149788 (Why is no real title available?)
- scientific article; zbMATH DE number 2046035 (Why is no real title available?)
- scientific article; zbMATH DE number 2067641 (Why is no real title available?)
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- A projected gradient method for vector optimization problems
- A steepest descent method for vector optimization
- Algorithms for the quasiconvex feasibility problem
- An Existence Theorem in Vector Optimization
- Convex Analysis
- Entropy-Like Proximal Methods in Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- Lower subdifferentiable functions and their minimization by cutting planes
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Proper efficiency and the theory of vector maximization
- Steepest descent methods for multicriteria optimization.
- Strict lower subdifferentiability and applications
Cited in
(48)- Multiobjective nonlinear optimization method ``vector simplex
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- A computational evaluation of two subgradient search methods
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Conditional gradient method for vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- Gradient-based algorithms for multi-objective bi-level optimization
- Proximal gradient methods for multiobjective optimization and their applications
- A proximal gradient splitting method for solving convex vector optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Nonmonotone proximal gradient method for composite multiobjective optimization problems
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Multiobjective search algorithm with subdivision technique
- Multiple reduced gradient method for multiobjective optimization problems
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A proximal point-type method for multicriteria optimization
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- A weighting subgradient algorithm for multiobjective optimization
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- A subgradient projection method for quasiconvex multiobjetive optimization
- A relaxed projection method for solving multiobjective optimization problems
- Proximal point type algorithms for solving multiobjective optimization problems beyond convexity
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- A strongly convergent proximal point method for vector optimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- A subgradient method for vector optimization problems
- A hybrid gradient method for vector optimization problems
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Proximal Newton methods for multiobjective optimization problems
- scientific article; zbMATH DE number 3887449 (Why is no real title available?)
- Descent algorithm for nonsmooth stochastic multiobjective optimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- A proximal gradient method with an explicit line search for multiobjective optimization
- Multi-criteria optimization in regression
- On global subdifferentials with applications in nonsmooth optimization
- A dynamic multiple proximal bundle algorithm for locally Lipschitz multiobjective optimization problems
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Nonsmooth multiobjective programming with quasi-Newton methods
- Memory gradient method for multiobjective optimization
- scientific article; zbMATH DE number 7709325 (Why is no real title available?)
- Reduced Jacobian method
- A conjugate directions-type procedure for quadratic multiobjective optimization
- A cutting-plane method to nonsmooth multiobjective optimization problems
This page was built for publication: A subgradient method for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377160)
