A line search technique for a class of multi-objective optimization problems using subgradient

DOI10.1007/S11117-024-01051-6MaRDI QIDQ6564720zbMATH OpenFDO

Authors D. Kumar, Geetanjali Panda

Publication date 1 July 2024

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11117-024-01051-6

zbMATH Keywords

convex optimizationline search techniquemulti-objective optimizationPareto optimal pointsub-gradient method

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Multi-objective and goal programming (90C29)

Recommendations

• A subgradient method for multiobjective optimization
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
• Nonmonotone line searches for unconstrained multiobjective optimization problems

Cites work

• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• A method for constrained multiobjective optimization based on SQP techniques
• A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
• A projected gradient method for vector optimization problems
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• A steepest descent method for vector optimization
• A subgradient method for multiobjective optimization
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
• Newton's method for multiobjective optimization
• Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
• Non-dominated sorting based multi/many-objective optimization: two decades of research and application
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems
• On q-steepest descent method for unconstrained multiobjective optimization problems
• On the convergence of the projected gradient method for vector optimization
• Proximal gradient methods for multiobjective optimization and their applications
• Quasi-Newton methods for solving multiobjective optimization
• Scalarization and separation by translation invariant functions. With applications in optimization, nonlinear functional analysis, and mathematical economics
• Steepest descent methods for multicriteria optimization.
• The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem

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)