A line search technique for a class of multi-objective optimization problems using subgradient
From MaRDI portal
Publication:6564720
DOI10.1007/s11117-024-01051-6MaRDI QIDQ6564720
Publication date: 1 July 2024
Published in: Positivity (Search for Journal in Brave)
multi-objective optimizationconvex optimizationsub-gradient methodline search techniquePareto optimal point
Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Title not available (Why is that?)
- Quasi-Newton methods for solving multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- A subgradient method for multiobjective optimization
- Proximal gradient methods for multiobjective optimization and their applications
- A method for constrained multiobjective optimization based on SQP techniques
- On the convergence of the projected gradient method for vector optimization
- Non-dominated Sorting Based Multi/Many-Objective Optimization: Two Decades of Research and Application
- Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
- Newton's Method for Multiobjective Optimization
- 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
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
This page was built for publication: A line search technique for a class of multi-objective optimization problems using subgradient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564720)